/*
Copyright 2023, Arani Chakravarti
This file is part of Homoeopim.
Homoeopim is free software: you can redistribute it and/or modify it under
the terms of the GNU Affero General Public License as published by the
Free Software Foundation, either version 3 of the License or any later
version.
Homoeopim 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 Affero General Public
License for more details.
You should have received a copy of the GNU Affero General Public License
along with Homoeopim. If not, see .
*/
/* This version of chikitsha_suggest contains code to use the `agenda'
function of CLIPS to form a list of the activations so as to allow a
doctor to see how exactly the remedies line up with the symptoms. These
details will be displayed below the usual sugestions table. This programme
may be considerably slower than the simpler version. */
#include
#include
#include
#include
#include
#include
#include
#include
#ifndef BEGIN
#define BEGIN(i) {
#define END(i) }
#endif
using namespace std;
/* This structure contains the CLIPS results for sorting and display.
primary_score stores the results evaluated with only the primary
symptoms declared by the patient. This value will be used to emphasise
those remedies which match with the primary symptoms. */
typedef struct {
int remedy_id;
float score;
float primary_score;
} rem_score;
///////////////////////////////////
class clips
{
private:
public:
//---------------------------------
clips() // constructor
{
InitializeEnvironment();
}
//---------------------------------
inline int CL_Load(char *c) { return(Load(c)); }
inline int CL_Bload(char *c) { return(Bload(c)); }
inline void CL_AssertString(char *c) { AssertString(c); }
inline void CL_Facts() { Facts((char*)"wdisplay",NULL,-1,-1,-1); }
inline void CL_Build(char *c) { Build(c); }
inline void CL_Reset() { Reset(); }
inline void CL_Clear() { Clear(); }
inline void CL_Run() { Run(-1L); }
//----------------------------------
// This is our own function - not in the original lib
inline void CL_get_global_value(char *name,char *retvalue,int retvalue_length)
{
GetDefglobalValueForm(retvalue,retvalue_length,FindDefglobal(name));
}
//----------------------------------
// friend declarations!
friend void InitializeEnvironment();
}; // end of class clips
/////////////////////////////////////
class chikitsha : public clips
BEGIN(0)
private:
char facts[1000][200];
char significant_facts[1000][200];
int num_facts;
int num_significant_facts;
char sql_command[300];
rem_score remedy_score[1500]; // The score array for suggesting remedies
PGconn *conn;
PGresult *res,*res1,*res2,*res3;
int user_id, otp;
int no_of_remedies;
DATA_OBJECT theValue; // CLIPS result storage
void **factPtrArray; // array of fact pointers - since garbage collection is
// disabled, these will be persistent during the run
void *facto; // to get at the facts
long int fact_index;
char rule_name[100];
char goda_fact_list[10000];
char agenda_list_table_name[200];
regex_t reegex1, reegex2; // these will be used to eliminate some
// fact entries from the display
public:
//--------------------------------
chikitsha() // Constructor
BEGIN(chititsha-0)
user_id = atoi(getenv("WWW_user_id")); // get user id
otp = atoi(getenv("WWW_otp")); // get otp
char connection_auth[100];
sprintf(connection_auth,"host=localhost port=5433 dbname=homoeopim user=homoeopim password=%s",getenv("HOMOEOPIM_DATABASE_PASSWORD"));
conn = PQconnectdb(connection_auth);
// Check whether logged out already
sprintf(sql_command,"select otp from otp where otp=%d",otp);
res = PQexec(conn,sql_command);
if(PQntuples(res) == 0)
{
cout << "\n";
cout << "\n";
cout << "\n";
cout << "\n";
cout << "\n";
cout << "OTP mismatch - you have probably logged out already!\n";
cout << "\n";
PQfinish(conn);
exit(0);
}
// Get the facts and populate facts array
sprintf(sql_command,"select type,significant_text from patient_details where patient_id = %d",user_id);
res = PQexec(conn,sql_command);
num_facts = PQntuples(res); // get number of facts
for(int i=0;i";
cout << "
Sl. No.
Remedy id.
Remedy
Score
\n";
int sl_no = 0;
for(int i=0;i 0) && (remedy_score[i].score >= remedy_score[0].score/10.0))
{
sprintf(sql_command,"select remedy from remedy where id = %d",remedy_score[i].remedy_id);
res = PQexec(conn,sql_command);
if(remedy_score[i].primary_score > 0) // emphasise
BEGIN(sort_scores-2)
cout << "
";
END(sort_scores-3)
}
}
cout << "";
END(sort_scores-0)
//--------------------------------
//This is completely experimental!
void get_agenda_in_database()
{
char buf[1000];
void *acto;
char new_sql_command[10100];
char goda_remedy_list[10000];
// This is a bad hack to get at facts via indices - can't find the
// appropriate function from the CLIPS apg!
GetFactList(&theValue,NULL);
num_facts = GetDOLength(theValue); // How many facts are there?
// There was an error in the index range previously - it was set
// to num_facts instead of num_facts+1 caused some heartburn!
factPtrArray = new void*[num_facts]; // an array of fact pointers
facto = NULL;
for(int i =0; i> puchkay;
sprintf(agenda_list_table_name,"agenda%hu",puchkay);
sprintf(sql_command,"create temporary table %s (defrule text,remedy_list text,fact_list text)",agenda_list_table_name);
PQexec(conn,sql_command);
acto = NULL; // get the activation agenda
acto = GetNextActivation(acto);
while(acto != NULL)
{
GetActivationPPForm(buf,1000,acto);
strcpy(rule_name,give_rule_name(buf));
sprintf(new_sql_command,"select defrule,remedy,score from defrule_remedy_map where defrule = '%s' order by remedy",rule_name);
res3 = PQexec(conn,new_sql_command);
goda_remedy_list[0] = '\0'; // initialise empty string;
strcat(goda_remedy_list,"
");
for(int i=0;i<(PQntuples(res3)-1);++i) // form the goda remedy name string with scores
{
strcat(goda_remedy_list,PQgetvalue(res3,i,1));
strcat(goda_remedy_list," (");
strcat(goda_remedy_list,PQgetvalue(res3,i,2));
strcat(goda_remedy_list,")
");
//debug
sprintf(new_sql_command,"insert into %s (defrule,remedy_list,fact_list) values ('%s','%s','%s')",agenda_list_table_name,rule_name,goda_remedy_list,give_facts_list_pretty(buf));
//sprintf(new_sql_command,"insert into %s (defrule,remedy_list,fact_list) values ('%s','%s','%s')",agenda_list_table_name,rule_name,goda_remedy_list,give_facts_list(buf));
//debug
//printf("give_facts_list_pretty(%s) is %s",buf,give_facts_list_pretty(buf));
//fflush(stdout);
PQexec(conn,new_sql_command);
acto = GetNextActivation(acto);
}
}
//............................
char* give_rule_name(char *buf)
{
char padding[200];
sscanf(buf,"0%[ ]%[^:]",padding,rule_name);
return(rule_name);
}
//..........................
char* give_facts_list(char *buf)
{
int fact_index_start = 0;
while(buf[fact_index_start] != ':')
{ ++fact_index_start; }
return (buf+fact_index_start+1);
}
//..........................
char* give_facts_list_pretty(char *buf)
{
char fList[5000]; // temporary storage for facts
char single_fact[1000]; // space for a single fact
int index; // to keep n from f-n
goda_fact_list[0] = '\0'; // initialise string
strcat(goda_fact_list,"
");
strcpy(fList,give_facts_list(buf)); // make a local copy
//debug
//printf("fList after strcpy = %s ",fList);
//fflush(stdout);
char faltu[2000]; // just a buffer to throw away the front part
//debug - originally i4 was set to 0 - caused segfault at 427
int i4 = 0;
while(i4 < (strlen(fList)-1))
{
sscanf(fList,"%[^f]f-%d", faltu,&index);
GetFactPPForm(single_fact,1000,factPtrArray[index]);
//debug
//printf("single_fact after GetFactPPForm is %s ",single_fact);
//fflush(stdout);
// We discard facts with certain patterns from the display
if((regexec(&reegex1,single_fact,0,NULL,0) != 0) &&
(regexec(&reegex2,single_fact,0,NULL,0) != 0))
{
strcat(goda_fact_list,"
");
strcat(goda_fact_list,single_fact);
//debug
//printf("goda_fact_list is %s ",goda_fact_list);
//fflush(stdout);
}
int j;
for(j=0;fList[j] !='f';++j)
{
fList[j] = ' ';
++i4;
} // clear front portion of fList
fList[j] = ' '; // clear the comma too
++i4;
}
strcat(goda_fact_list,"
\n";
}
//--------------------------
void print_matrix() // completely experimental as per Pook's demand
BEGIN(print_matrix_0)
char tmp_name[200];
char short_name[50];
int start,end;
int j;
int selected_remedy_indices[1000]; // keeps the indices of the displayed remedies
int no_of_selected_remedies; // total number of remedies displayed
cout << "
\n";
cout << "
\n";
cout << "
Defrule and facts-list
\n";
no_of_selected_remedies = 0;
for(int i=0;i 0) && (remedy_score[i].score >= remedy_score[0].score/10.0))
BEGIN(print_matrix_2)
selected_remedy_indices[no_of_selected_remedies] = i;
++no_of_selected_remedies;
sprintf(sql_command,"select remedy from remedy where id = %d",remedy_score[i].remedy_id);
res = PQexec(conn,sql_command);
strcpy(tmp_name,PQgetvalue(res,0,0)); // We try to extract the short names
end = strlen(tmp_name)-2; // leave out the closing bracket
start = end;
j = 0;
while(tmp_name[start] != '(')
{ start--; }
start++; // leave out the opening bracket
for(int i=start;i<=end;++i)
BEGIN(print_matrix_3)
short_name[j] = tmp_name[i];
++j;
END(print_matrix_3)
short_name[j+1] = '\0'; // short_name now contains the short name
cout << "
\n";
sprintf(sql_command,"select defrule,remedy_list,fact_list from %s",agenda_list_table_name);
res = PQexec(conn,sql_command);
int nnnn = PQntuples(res);
for(int i=0;i
";
//debug -- how to speed up?
daktaar.print_activation_matches(); // completely experimental!
// This is where maximum delay occurs!
daktaar.print_matrix(); // completely experimental!
cout << "\n";
END(main-0)