forked from geckom/ChatScript
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfactSystem.cpp
1571 lines (1449 loc) · 43.1 KB
/
factSystem.cpp
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
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include "common.h"
#ifdef INFORMATION
Facts are added as layers.You remove facts by unpeeling a layer.You can "delete" a fact merely by
marking it dead.
Layer - 1: facts resulting from wordnet dictionary(wordnetFacts)
Layer0 : facts resulting from topic system build0
Layer1 : facts resulting from topic system build1
Layer2 : facts created by user
Layer 2 is always unpeeled after an interchange with the chatbot, in preparation for a new user who may chat with a different persona.
Layers 0 and 1 are unpeeled if you want to restart the topic system to read in new topic data on the fly or rebuild 0.
Layer 1 is unpeeled for a new build 1.
Layer - 1 is never unpeeled.If you want to modify the dictionary, you either restart the chatbot entirely
or patch in data piggy backing on facts(like from the topic system).
Unpeeling a layer implies you will also reset dictionary / stringspace pointers back to levels at the
start of the layer since facts may have allocated dictionary and string items.
This is ReturnToDictionaryFreeze for unpeeling 3 / 4 and ReturnDictionaryToWordNet for unpeeling layer 2.
#endif
int worstFactFree = 1000000;
char traceSubject[100];
char traceVerb[100];
char traceObject[100];
uint64 allowedBots = 0xffffffffffffffffULL; // default fact visibility restriction is all bots
uint64 myBot = 0; // default fact creation restriction
size_t maxFacts = MAX_FACT_NODES; // how many facts we can create at max
FACT* factBase = NULL; // start of all facts
FACT* factEnd = NULL; // end of all facts
FACT* factsPreBuild[NUMBER_OF_LAYERS+1]; // end of build0 facts, start of build1 facts
FACT* factFree = NULL; // currently next fact we can reuse for allocation
FACT* currentFact = NULL; // current fact
// values of verbs to compare against
MEANING Mmember; // represents concept sets
MEANING Mis; // represents wordnet hierarchy
MEANING Mexclude; // represents restriction of word not allowed in set (blocking inheritance)
FACT* Index2Fact(FACTOID e)
{
FACT* F = NULL;
if (e)
{
F = e + factBase;
if (F > factFree)
{
char buf[MAX_WORD_SIZE];
strcpy(buf, StdIntOutput(factFree - factBase));
ReportBug((char*)"Illegal fact index %d last:%s ", e, buf);
F = NULL;
}
}
return F;
}
static bool UnacceptableFact(FACT* F,bool jsonavoid)
{
if (!F || F->flags & FACTDEAD) return true;
// if ownership flags exist (layer0 or layer1) and we have different ownership.
if (!compiling && F->botBits && !(F->botBits & myBot)) return true;
return false;
}
FACT* GetSubjectNext(FACT* F) { return Index2Fact(F->subjectNext);}
FACT* GetVerbNext(FACT* F) {return Index2Fact(F->verbNext);}
FACT* GetObjectNext(FACT* F) {return Index2Fact(F->objectNext);}
FACT* GetSubjectNondeadNext(FACT* F,bool jsonaccept)
{
FACT* G = F;
while (F)
{
F = Index2Fact(F->subjectNext);
if (F && !UnacceptableFact(F,jsonaccept)) break;
}
if (F == G)
{
ReportBug("Infinite loop in GetSubjectNondeadNext ")
F = NULL;
}
return F;
}
FACT* GetVerbNondeadNext(FACT* F)
{
FACT* G = F;
while (F)
{
F = Index2Fact(F->verbNext);
if (F && !UnacceptableFact(F,true)) break;
}
if (F == G)
{
ReportBug("Infinite loop in GetVerbNondeadNext ")
F = NULL;
}
return F;
}
FACT* GetObjectNondeadNext(FACT* F)
{
FACT* G = F;
while (F)
{
F = Index2Fact(F->objectNext);
if (F && !UnacceptableFact(F,true)) break;
}
if (F == G)
{
ReportBug("Infinite loop in GetObjectNondeadNext ")
F = NULL;
}
return F;
}
FACT* GetSubjectNondeadHead(FACT* F)
{
F = Index2Fact(F->subjectHead);
while (F && UnacceptableFact(F,true))
{
F = Index2Fact(F->subjectNext);
}
return F;
}
FACT* GetVerbNondeadHead(FACT* F)
{
F = Index2Fact(F->verbHead);
while (F && UnacceptableFact(F,true))
{
F = Index2Fact(F->verbNext);
}
return F;
}
FACT* GetObjectNondeadHead(FACT* F)
{
F = Index2Fact(F->objectHead);
while (F && UnacceptableFact(F,true))
{
F = Index2Fact(F->objectNext);
}
return F;
}
FACT* GetSubjectNondeadHead(WORDP D, bool jsonaccess) // able to get special marker empty fact for json units
{
if (!D) return NULL;
FACT* F = Index2Fact(D->subjectHead);
while (F && UnacceptableFact(F,jsonaccess))
{
F = Index2Fact(F->subjectNext);
}
return F;
}
FACT* GetVerbNondeadHead(WORDP D)
{
if (!D) return NULL;
FACT* F = Index2Fact(D->verbHead);
while (F && UnacceptableFact(F,true))
{
F = Index2Fact(F->verbNext);
}
return F;
}
FACT* GetObjectNondeadHead(WORDP D)
{
if (!D) return NULL;
FACT* F = Index2Fact(D->objectHead);
while (F && UnacceptableFact(F,true))
{
F = Index2Fact(F->objectNext);
}
return F;
}
void SetSubjectNext(FACT* F, FACT* value){ F->subjectNext = Fact2Index(value);}
void SetVerbNext(FACT* F, FACT* value) {F->verbNext = Fact2Index(value);}
void SetObjectNext(FACT* F, FACT* value){ F->objectNext = Fact2Index(value);}
FACTOID Fact2Index(FACT* F)
{
return (F) ? ((FACTOID)(F - factBase)) : 0;
}
FACT* FactTextIndex2Fact(char* id) // given number word, get corresponding fact
{
char word[MAX_WORD_SIZE];
strcpy(word,id);
char* comma = word;
while ((comma = strchr(comma,','))) memmove(comma,comma+1,strlen(comma)); // maybe number has commas, like 100,000,300 . remove them
unsigned int n = atoi(word);
if (n <= 0) return NULL;
return (n <= (unsigned int)(factFree-factBase)) ? Index2Fact(n) : NULL;
}
int GetSetID(char* x)
{
if (*x != '@') return ILLEGAL_FACTSET;
if (!IsDigit(*++x)) return ILLEGAL_FACTSET;
unsigned int n = *x - '0';
if (IsDigit(*++x)) n = (n * 10) + *x - '0';
// allow additional characters naming a field
return (n > MAX_FIND_SETS) ? ILLEGAL_FACTSET : n;
}
bool GetSetMod(char* x)
{
if (!IsDigit(*++x)) return false; // illegal set
if (IsDigit(*++x)) ++x;
if ((*x == 's' || *x == 'S' ) && strnicmp(x,(char*)"subject",7)) return false;
if ((*x == 'v' || *x == 'V' )&& strnicmp(x,(char*)"verb",4)) return false;
if ((*x == 'o' || *x == 'O' )&& strnicmp(x,(char*)"object",6)) return false;
if ((*x == 'a' || *x == 'A' )&& strnicmp(x,(char*)"all",4)) return false;
if ((*x == 'f'|| *x == 'F' ) && strnicmp(x,(char*)"fact",4)) return false;
return true;
}
char* GetSetType(char* x)
{ // @13subject returns subject
if (!x[0] || !x[1] ) return ""; // safety from bad data
x += 2;
if (IsDigit(*x)) ++x;
return x;
}
char* GetSetEnd(char* x)
{ // @adagsubject returns subject
char* start = x;
while (IsAlphaUTF8(*++x)){;} // find natural end.
size_t len = x - start; // this long
if (len >= 9 && !strnicmp(x-7,(char*)"subject",7)) x -= 7;
else if (len >= 6 && !strnicmp(x-4,(char*)"verb",4)) x -= 4;
else if (len >= 8 && !strnicmp(x-6,(char*)"object",6)) x -= 6;
else if (len >= 6 && !strnicmp(x-4,(char*)"fact",4)) x -= 4;
else if (len >= 5 && !strnicmp(x-3,(char*)"all",3)) x -= 3;
if (IsDigit(*x)) ++x;
return x;
}
void TraceFact(FACT* F,bool ignoreDead)
{
char* limit;
char* word = InfiniteStack(limit,"TraceFact"); // short term
Log(STDTRACELOG,(char*)"%d: %s\r\n",Fact2Index(F),WriteFact(F,false,word,ignoreDead,false));
Log(STDTRACETABLOG,(char*)"");
ReleaseInfiniteStack();
}
void ClearUserFacts()
{
while (factFree > factLocked) FreeFact(factFree--); // erase new facts
}
void InitFacts()
{
*traceSubject = 0;
*traceVerb = 0;
*traceObject = 0;
if ( factBase == 0)
{
factBase = (FACT*) malloc(maxFacts * sizeof(FACT)); // only on 1st startup, not on reload
if ( factBase == 0)
{
(*printer)((char*)"%s",(char*)"failed to allocate fact space\r\n");
myexit((char*)"failed to get fact space");
}
}
memset(factBase,0,sizeof(FACT) * maxFacts); // not strictly necessary
factFree = factBase;
factEnd = factBase + maxFacts;
}
void InitFactWords()
{
// special internal fact markers
Mmember = MakeMeaning(StoreWord((char*)"member",AS_IS));
Mexclude = MakeMeaning(StoreWord((char*)"exclude", AS_IS));
Mis = MakeMeaning(StoreWord((char*)"is", AS_IS));
}
void CloseFacts()
{
free(factBase);
factBase = 0;
}
void FreeFact(FACT* F)
{ // most recent facts are always at the top of any xref list. Can only free facts sequentially backwards.
if (!F->subject) // unindexed fact recording a fact delete that must be undeleted
{
if (!F->object) // death of fact fact (verb but no object)
{
F = Index2Fact(F->verb);
F->flags &= -1 ^ FACTDEAD;
}
else if (F->flags & ITERATOR_FACT) {;} // holds iterator backtrack
else // undo a variable assignment fact (verb and object)
{
WORDP D = Meaning2Word(F->verb); // the variable
unsigned int offset = (unsigned int) F->object;
D->w.userValue = (offset == 1) ? NULL : (heapBase + offset);
}
}
else // normal indexed fact
{
if (!(F->flags & FACTSUBJECT)) SetSubjectHead(F->subject,GetSubjectNext(F)); // dont use nondead
else SetSubjectHead(Index2Fact(F->subject),GetSubjectNext(F)); // dont use nondead
if (!(F->flags & FACTVERB)) SetVerbHead(F->verb,GetVerbNext(F)); // dont use nondead
else SetVerbHead(Index2Fact(F->verb),GetVerbNext(F)); // dont use nondead
if (!(F->flags & FACTOBJECT)) SetObjectHead(F->object,GetObjectNext(F)); // dont use nondead
else SetObjectHead(Index2Fact(F->object),GetObjectNext(F)); // dont use nondead
}
}
unsigned int AddFact(unsigned int set, FACT* F) // fact added to factset
{
unsigned int count = FACTSET_COUNT(set);
if (++count > MAX_FIND) --count;
factSet[set][count] = F;
SET_FACTSET_COUNT(set,count);
return count;
}
FACT* SpecialFact(FACTOID_OR_MEANING verb, FACTOID_OR_MEANING object,unsigned int flags)
{
// allocate a fact
if (++factFree == factEnd)
{
--factFree;
ReportBug((char*)"out of fact space at %d",Fact2Index(factFree))
(*printer)((char*)"%s",(char*)"out of fact space");
return factFree; // dont return null because we dont want to crash anywhere
}
// init the basics
memset(factFree,0,sizeof(FACT));
factFree->verb = verb;
factFree->object = object;
factFree->flags = FACTTRANSIENT | FACTDEAD | flags; // cannot be written or kept
return factFree;
}
static void ReleaseDictWord(WORDP D,WORDP dictbase)
{
char c = *D->word;
// dont erase interally used words
if (c == '$' || c == '~' || c == '^' || c == '%' || c == '#') return;
if (D >= dictbase) // we dont have to protect this
{
if (!(D->internalBits & BEEN_HERE) && !GetSubjectNondeadHead(D))
{
D->word = " "; // kill off its name
}
}
}
static void MarkDictWord(WORDP D, WORDP dictbase)
{ // insure this word is safe from destruction
if (D >= dictbase)
D->internalBits |= BEEN_HERE;
}
void RipFacts(FACT* F,WORDP dictBase)
{
FACT* base = factFree++;
while (--factFree > F) // mark all still used new dict words
{
if (!(F->flags & FACTDEAD))
{
MarkDictWord(Meaning2Word(factFree->subject), dictBase);
MarkDictWord(Meaning2Word(factFree->verb), dictBase);
MarkDictWord(Meaning2Word(factFree->object), dictBase);
}
}
factFree = base + 1;
while (--factFree > F)
{
FreeFact(factFree); // remove all links from dict
if (F->flags & FACTDEAD) // release
{
ReleaseDictWord(Meaning2Word(factFree->subject), dictBase);
ReleaseDictWord(Meaning2Word(factFree->verb), dictBase);
ReleaseDictWord(Meaning2Word(factFree->object), dictBase);
}
}
factFree = base;
}
FACT* WeaveFact(FACT* currentFact, unsigned int properties)
{
FACT* F;
WORDP s = (properties & FACTSUBJECT) ? NULL : Meaning2Word(currentFact->subject);
WORDP v = (properties & FACTVERB) ? NULL : Meaning2Word(currentFact->verb);
WORDP o = (properties & FACTOBJECT) ? NULL : Meaning2Word(currentFact->object);
// crossreference
if (s)
{
SetSubjectNext(currentFact, GetSubjectHead(currentFact->subject)); // dont use nondead
SetSubjectHead(currentFact->subject, currentFact);
}
else
{
F = Index2Fact(currentFact->subject);
if (F)
{
SetSubjectNext(currentFact, GetSubjectHead(F)); // dont use nondead
SetSubjectHead(F, currentFact);
}
else return NULL;
}
if (v)
{
SetVerbNext(currentFact, GetVerbHead(currentFact->verb)); // dont use nondead
SetVerbHead(currentFact->verb, currentFact);
}
else
{
F = Index2Fact(currentFact->verb);
if (F)
{
SetVerbNext(currentFact, GetVerbHead(F)); // dont use nondead
SetVerbHead(F, currentFact);
}
else return NULL;
}
if (o)
{
SetObjectNext(currentFact, GetObjectHead(currentFact->object)); // dont use nondead
SetObjectHead(currentFact->object, currentFact);
}
else
{
F = Index2Fact(currentFact->object);
if (F)
{
SetObjectNext(currentFact, GetObjectNext(F)); // dont use nondead
SetObjectHead(F, currentFact);
}
else return NULL;
}
return currentFact;
}
void WeaveFacts(FACT* F)
{
while (F <= factFree)
{
WeaveFact(F,F->flags);
++F;
}
}
void AutoKillFact(MEANING M)
{
int id = atoi(Meaning2Word(M)->word);
KillFact(Index2Fact(id));
}
void KillFact(FACT* F,bool jsonrecurse, bool autoreviseArray)
{
if (!F || F->flags & FACTDEAD) return; // already dead
if (F <= factsPreBuild[currentBeforeLayer])
return; // may not kill off facts built into world
F->flags |= FACTDEAD;
if (trace & TRACE_FACT && CheckTopicTrace())
{
Log(STDTRACELOG,(char*)"Kill: ");
TraceFact(F);
}
if (F->flags & FACTAUTODELETE)
{
if (F->flags & FACTSUBJECT) AutoKillFact(F->subject);
if (F->flags & FACTVERB) AutoKillFact(F->verb);
if (F->flags & FACTOBJECT) AutoKillFact(F->object);
}
// recurse on JSON datastructures below if they are being deleted on right side
if (F->flags & (JSON_ARRAY_VALUE | JSON_OBJECT_VALUE) && jsonrecurse)
{
WORDP jsonarray = Meaning2Word(F->object);
// should it recurse to kill guy refered to?
// if no other living fact refers to it, you can also kill the referred object/array
FACT* H = GetObjectNondeadHead(jsonarray); // facts which link to this
if (!H) jkillfact(jsonarray);
}
if (autoreviseArray && F->flags & JSON_ARRAY_FACT) JsonRenumber(F);// have to renumber this array
if (planning) SpecialFact(Fact2Index(F),0,0); // save to restore
// if this fact has facts depending on it, they too must die
FACT* G = GetSubjectNondeadHead(F);
while (G)
{
KillFact(G);
G = GetSubjectNondeadNext(G);
}
G = GetVerbNondeadHead(F);
while (G)
{
KillFact(G);
G = GetVerbNondeadNext(G);
}
G = GetObjectNondeadHead(F);
while (G)
{
KillFact(G);
G = GetObjectNondeadNext(G);
}
}
void ResetFactSystem(FACT* locked)
{
while (factFree > locked) FreeFact(factFree--); // restore to end of basic facts
for (unsigned int i = 0; i <= MAX_FIND_SETS; ++i) // clear any factset with contaminated data
{
unsigned int limit = FACTSET_COUNT(i);
for (unsigned int k = 1; k <= limit; ++k)
{
if (factSet[i][k] > locked)
{
SET_FACTSET_COUNT(i, 0); // empty all facts since set is contaminated
break;
}
}
}
}
FACT* FindFact(FACTOID_OR_MEANING subject, FACTOID_OR_MEANING verb, FACTOID_OR_MEANING object, unsigned int properties)
{
FACT* F;
FACT* G;
if (!subject || !verb || !object) return NULL;
if (properties & FACTDUPLICATE)
return NULL; // can never find this since we are allowed to duplicate and we do NOT want to share any existing fact
// see if fact already exists. if so, just return it
if (properties & FACTSUBJECT)
{
F = Index2Fact(subject);
G = GetSubjectNondeadHead(F);
while (G)
{
if (G->verb == verb && G->object == object && G->flags == properties && G->botBits == myBot) return G;
G = GetSubjectNondeadNext(G);
}
return NULL;
}
else if (properties & FACTVERB)
{
F = Index2Fact(verb);
G = GetVerbNondeadHead(F);
while (G)
{
if (G->subject == subject && G->object == object && G->flags == properties && G->botBits == myBot) return G;
G = GetVerbNondeadNext(G);
}
return NULL;
}
else if (properties & FACTOBJECT)
{
F = Index2Fact(object);
G = GetObjectNondeadHead(F);
while (G)
{
if (G->subject == subject && G->verb == verb && G->flags == properties && G->botBits == myBot) return G;
G = GetObjectNondeadNext(G);
}
return NULL;
}
// simple FACT* based on dictionary entries
F = GetSubjectNondeadHead(Meaning2Word(subject));
while (F)
{
if ( F->subject == subject && F->verb == verb && F->object == object && properties == F->flags && F->botBits == myBot) return F;
F = GetSubjectNondeadNext(F);
}
return NULL;
}
FACT* CreateFact(FACTOID_OR_MEANING subject, FACTOID_OR_MEANING verb, FACTOID_OR_MEANING object, unsigned int properties)
{
currentFact = NULL;
if (!subject || !object || !verb)
{
if (!subject)
ReportBug((char*)"Missing subject field in fact create at line %d of %s",currentFileLine,currentFilename)
if (!verb)
ReportBug((char*)"Missing verb field in fact create at line %d of %s",currentFileLine,currentFilename)
if (!object)
ReportBug((char*)"Missing object field in fact create at line %d of %s",currentFileLine,currentFilename)
return NULL;
}
// get correct field values
WORDP s = (properties & FACTSUBJECT) ? NULL : Meaning2Word(subject);
WORDP v = (properties & FACTVERB) ? NULL : Meaning2Word(verb);
WORDP o = (properties & FACTOBJECT) ? NULL : Meaning2Word(object);
if (s && *s->word == 0)
{
ReportBug((char*)"bad choice in fact subject")
return NULL;
}
if (v && *v->word == 0)
{
ReportBug((char*)"bad choice in fact verb")
return NULL;
}
if (o && *o->word == 0)
{
ReportBug((char*)"bad choice in fact object")
return NULL;
}
// convert any restricted meaning
MEANING other;
char* word;
if (s && (word = s->word) && *word != '"' && strchr(word+1,'~')) // has number or word after it? convert notation
{
other = ReadMeaning(word,true,true);
if (Meaning2Word(other) == s) {;}
else if (Meaning2Index(other) || GETTYPERESTRICTION(other)) subject = other;
}
if (v && (word = v->word) && strchr(word+1,'~')) // has number or word after it? convert notation
{
other = ReadMeaning(word,true,true);
if (Meaning2Word(other) == v) {;}
else if (Meaning2Index(other) || GETTYPERESTRICTION(other)) verb = other;
}
if (o && (word = o->word) && strchr(word+1,'~')) // has number or word after it? convert notation
{
other = ReadMeaning(word,true,true);
if (Meaning2Word(other) == o) {;}
else if (Meaning2Index(other) || GETTYPERESTRICTION(other)) object = other;
}
if (*traceSubject)
{
if (s && !stricmp(s->word,traceSubject) && *traceVerb && *traceObject)
{
DebugCode(NULL);
}
else if (s && !stricmp(s->word,traceSubject) && v && !stricmp(s->word,traceVerb) && *traceObject)
{
DebugCode(NULL);
}
else if (s && !stricmp(s->word,traceSubject) && o && !stricmp(s->word,traceObject) && *traceVerb)
{
DebugCode(NULL);
}
else if (s && !stricmp(s->word,traceSubject) && v && !stricmp(s->word,traceVerb) && o && !stricmp(s->word,traceObject))
{
DebugCode(NULL);
}
}
if (*traceVerb)
{
if (v && !stricmp(v->word,traceVerb) && *traceSubject && *traceObject)
{
DebugCode(NULL);
}
else if (v && !stricmp(s->word,traceVerb) && *traceSubject && o && !stricmp(s->word,traceObject))
{
DebugCode(NULL);
}
}
if (*traceObject)
{
if (o && !stricmp(o->word,traceObject) && *traceSubject && *traceVerb)
{
DebugCode(NULL);
}
}
if (compiling)
{
if (buildId == BUILD1) properties |= FACTBUILD1;
}
// insure fact is unique if requested
currentFact = (properties & FACTDUPLICATE) ? NULL : FindFact(subject,verb,object,properties);
if (trace & TRACE_FACT && currentFact && CheckTopicTrace()) Log(STDTRACELOG,(char*)" Found %d ", Fact2Index(currentFact));
if (currentFact) return currentFact;
currentFact = CreateFastFact(subject,verb,object,properties);
if (trace & TRACE_FACT && currentFact && CheckTopicTrace())
{
Log(STDTRACELOG,(char*)" Created %d\r\n", Fact2Index(currentFact));
Log(STDTRACETABLOG,(char*)"");
}
return currentFact;
}
bool ExportFacts(char* name, int set,char* append)
{
if (set < 0 || set > MAX_FIND_SETS) return false;
if ( *name == '"')
{
++name;
size_t len = strlen(name);
if (name[len-1] == '"') name[len-1] = 0;
}
char* buffer = GetFreeCache();
char* base = buffer;
char* limit;
char* word = InfiniteStack(limit,"ExportFacts"); //short term
unsigned int count = FACTSET_COUNT(set);
for (unsigned int i = 1; i <= count; ++i)
{
FACT* F = factSet[set][i];
if (!F) strcpy(buffer,(char*)"null ");
else if ( !(F->flags & FACTDEAD))
{
unsigned int original = F->flags;
F->flags &= -1 ^ FACTTRANSIENT; // dont pass transient flag out
strcpy(buffer,WriteFact(F,false,word,false,true));
F->flags = original;
}
buffer += strlen(buffer);
}
ReleaseInfiniteStack();
FILE* out;
if (strstr(name,"ltm")) out = userFileSystem.userCreate(name); // user ltm file
else out = (append && !stricmp(append,"append")) ? FopenUTF8WriteAppend(name) : FopenUTF8Write(name);
if (out)
{
if (strstr(name,"ltm"))
{
EncryptableFileWrite(base,1,(buffer-base),out,ltmEncrypt,"LTM");
userFileSystem.userClose(out);
}
else
{
fprintf(out,(char*)"%s",base);
fclose(out);
}
}
FreeUserCache();
return (out) ? true : false;
}
static char* ExportJson1(char* jsonitem, char* buffer)
{
if (!*jsonitem)
{
strcpy(buffer,(char*)"null\r\n");
return buffer + strlen(buffer);
}
WORDP D = FindWord(jsonitem);
if (!D) return buffer;
FACT* F = GetSubjectNondeadHead(D);
while (F)
{
if ( !(F->flags & FACTDEAD))
{
unsigned int original = F->flags;
F->flags &= -1 ^ FACTTRANSIENT; // dont pass transient flag out
WriteFact(F,false,buffer,false,true);
buffer += strlen(buffer);
F->flags = original;
}
if (F->flags & (JSON_ARRAY_VALUE|JSON_OBJECT_VALUE)) buffer = ExportJson1(Meaning2Word(F->object)->word,buffer); // on object side of triple
F = GetSubjectNondeadNext(F);
}
return buffer + strlen(buffer);
}
FunctionResult ExportJson(char* name, char* jsonitem, char* append)
{
WORDP D;
if (*jsonitem)
{
D = FindWord(jsonitem);
if (!D) return FAILRULE_BIT;
}
if ( *name == '"')
{
++name;
size_t len = strlen(name);
if (name[len-1] == '"') name[len-1] = 0;
}
FILE* out;
if (strstr(name,"ltm")) out = userFileSystem.userCreate(name); // user ltm file
else out = (append && !stricmp(append,"append")) ? FopenUTF8WriteAppend(name) : FopenUTF8Write(name);
if (!out) return FAILRULE_BIT;
char* buffer = GetFreeCache(); // filesize limit
ExportJson1(jsonitem, buffer);
if (strstr(name,"ltm"))
{
EncryptableFileWrite(buffer,1,strlen(buffer),out,ltmEncrypt,"LTM");
userFileSystem.userClose(out);
}
else
{
fprintf(out,(char*)"%s",buffer);
fclose(out);
}
FreeUserCache();
return NOPROBLEM_BIT;
}
char* EatFact(char* ptr,char* buffer,unsigned int flags,bool attribute)
{
ptr = SkipWhitespace(ptr); // could be user-formateed, dont trust
FunctionResult result = NOPROBLEM_BIT;
// subject
if (*ptr == '(') // nested fact
{
ptr = EatFact(ptr+1,buffer); // returns after the closing paren
flags |= FACTSUBJECT;
sprintf(buffer,(char*)"%d",currentFactIndex() ); // created OR e found instead of created
}
else ptr = GetCommandArg(ptr,buffer,result,OUTPUT_FACTREAD); // subject
ptr = SkipWhitespace(ptr); // could be user-formateed, dont trust
if (!ptr) return NULL;
if (result & ENDCODES) return ptr;
if (!*buffer)
{
if (!ptr) return NULL;
if (compiling) BADSCRIPT((char*)"FACT-1 Missing subject for fact create")
char* end = strchr(ptr,')');
return (end) ? (end + 2) : ptr;
}
char* word = AllocateStack(buffer);
*buffer = 0;
//verb
if (*ptr == '(') // nested fact
{
ptr = EatFact(ptr+1,buffer);
flags |= FACTVERB;
sprintf(buffer,(char*)"%d",currentFactIndex() );
}
else ptr = GetCommandArg(ptr,buffer,result,OUTPUT_FACTREAD); //verb
if (!ptr)
{
ReleaseStack(word);
return NULL;
}
ptr = SkipWhitespace(ptr); // could be user-formateed, dont trust
if (result & ENDCODES)
{
ReleaseStack(word);
return ptr;
}
if (!*buffer)
{
ReleaseStack(word);
if (!ptr) return NULL;
if (compiling) BADSCRIPT((char*)"FACT-2 Missing verb for fact create")
char* end = strchr(ptr,')');
return (end) ? (end + 2) : ptr;
}
char* word1 = AllocateStack(buffer);
*buffer = 0;
// object
if (*ptr == '(') // nested fact
{
ptr = EatFact(ptr+1,buffer);
flags |= FACTOBJECT;
sprintf(buffer,(char*)"%d",currentFactIndex() );
}
else ptr = GetCommandArg(ptr,buffer,result,OUTPUT_FACTREAD);
ptr = SkipWhitespace(ptr); // could be user-formateed, dont trust
if (result & ENDCODES)
{
ReleaseStack(word);
return ptr;
}
if (!*buffer)
{
ReleaseStack(word);
if (compiling) BADSCRIPT((char*)"FACT-3 Missing object for fact create - %s",readBuffer)
if (!ptr) return NULL;
char* end = strchr(ptr,')');
return (end) ? (end + 2) : ptr;
}
char* word2 = AllocateStack(buffer);
*buffer = 0;
uint64 fullflags;
bool bad = false;
bool response = false;
char strip[MAX_WORD_SIZE];
char* at = ReadCompiledWord(ptr,strip);
bool stripquote = false;
if (!strnicmp(strip,(char*)"STRIP_QUOTE",11))
{
stripquote = true;
ptr = at;
}
ptr = ReadFlags(ptr,fullflags,bad,response);
flags |= (unsigned int) fullflags;
MEANING subject;
if ( flags & FACTSUBJECT)
{
subject = atoi(word);
if (!subject) subject = 1; // make a phony fact
}
else if (stripquote)
{
size_t len = strlen(word);
if (*word == '"' && word[len-1] == '"')
{
word[len-1] = 0;
memmove(word,word+1,strlen(word));
}
subject = MakeMeaning(StoreWord(word,AS_IS),0);
}
else subject = MakeMeaning(StoreWord(word,AS_IS),0);
MEANING verb;
if ( flags & FACTVERB)
{
verb = atoi(word1);
if (!verb) verb = 1; // make a phony fact
}
else if (stripquote)
{
size_t len = strlen(word1);
if (*word1 == '"' && word1[len-1] == '"')
{
word1[len-1] = 0;
memmove(word1,word1+1,strlen(word1));
}
verb = MakeMeaning(StoreWord(word1,AS_IS),0);
}
else verb = MakeMeaning(StoreWord(word1,AS_IS),0);
MEANING object;
if ( flags & FACTOBJECT)
{
object = atoi(word2);
if (!object) object = 1; // make a phony fact
}
else if (stripquote)
{
size_t len = strlen(word2);
if (*word2 == '"' && word2[len-1] == '"')
{
word2[len-1] = 0;
memmove(word2,word2+1,strlen(word2));
}
object = MakeMeaning(StoreWord(word2,AS_IS),0);
}
else object = MakeMeaning(StoreWord(word2,AS_IS),0);
if (trace & TRACE_OUTPUT && CheckTopicTrace()) Log(STDTRACELOG,(char*)"%s %s %s %x) = ",word,word1,word2,flags);
FACT* F = FindFact(subject,verb,object,flags);
if (!attribute || (F && object == F->object)) {;} // not making an attribute or already made
else // remove any facts with same subject and verb, UNlESS part of some other fact
{
if (flags & FACTSUBJECT) F = GetSubjectNondeadHead(Index2Fact(subject));
else F = GetSubjectNondeadHead(subject);
while (F)
{
if (F->subject == subject && F->verb == verb)
{
if (!(F->flags & FACTATTRIBUTE)) // this is a script failure. Should ONLY be an attribute
{
char word[MAX_WORD_SIZE];
WriteFact(F,false,word,false,true);
Log(STDTRACELOG,(char*)"Fact created is not an attribute. There already exists %s",word);
(*printer)((char*)"Fact created is not an attribute. There already exists %s",word);
currentFact = F;
return (*ptr) ? (ptr + 2) : ptr;
}
KillFact(F);
}
F = GetSubjectNondeadNext(F);
}
}
F = CreateFact(subject,verb,object,flags);
if (attribute) F->flags |= FACTATTRIBUTE;