@@ -11,6 +11,10 @@

 #include "include/kmeans.h"

 #include "include/mtree.h"

+//R includes

+#include <R.h>

+#include <Rdefines.h>

+

 int argmin(vector& x, array<vector>& M)

 {

@@ -56,9 +60,10 @@ array<vector> kmeans_init(int K, matrix& X, double min_diff = 1e-10)

   if (i >= N)  // failure

     {

-      std::cerr << "k-means: Unable to find k = " << K << " sufficiently (min_diff >= " << min_diff << ") different vectors!" << std::endl

-		<< "         Try changing k or min_diff." << std::endl;

-      exit(1);

+      //std::cerr << "k-means: Unable to find k = " << K << " sufficiently (min_diff >= " << min_diff << ") different vectors!" << std::endl

+		//<< "         Try changing k or min_diff." << std::endl;

+      //exit(1);

+	  Rf_error("internal: mtreemix invoked 'exit(%d)'\n k-means: Unable to find k = %d sufficiently (min_diff >= %5.3e) different vectors!\n Try changing k or min_diff.\n", K, min_diff);

     }

   return M;

@@ -11,6 +11,10 @@

 #include "include/mtree.h"

+//R includes

+#include <R.h>

+#include <Rdefines.h>

+

 array<string> load_profile(char *filestem, int L)

 {

@@ -40,8 +44,9 @@ array<string> load_profile(char *filestem, int L)

       if (j != L)

 	{

-	  std::cerr << "Number of profile labels does not coincide with number of data columns and/or model dimensions!" << std::endl;

-	  exit(1);

+	  //std::cerr << "Number of profile labels does not coincide with number of data columns and/or model dimensions!" << std::endl;

+	  //exit(1);

+	  Rf_error("internal: mtreemix invoked 'exit(%d)'\n Number of profile labels does not coincide with number of data columns and/or model dimensions!\n see warnings() and restart R", 1);

 	}

     }

@@ -67,8 +72,9 @@ void save_profile(array<string>& profile, char* filestem)

   std::ofstream prf(filename);

   if (! prf)

     {

-      std::cerr << "Can't open output file -- " << filename << std::endl;

-      exit(1);

+      //std::cerr << "Can't open output file -- " << filename << std::endl;

+      //exit(1);

+	  Rf_error("internal: mtreemix invoked 'exit(%d)'\n Can't open output file %s!\n see warnings() and restart R", 1, filename);

     }

   for (int j=0; j<L; j++)

@@ -90,8 +96,9 @@ integer_matrix load_pattern(char *filestem)

   std::ifstream patfile(filename);

   if (! patfile)

     {

-      std::cerr << "Can't open input file -- " << filename << std::endl;

-      exit(1);

+      //std::cerr << "Can't open input file -- " << filename << std::endl;

+      //exit(1);

+	  Rf_error("internal: mtreemix invoked 'exit(%d)'\n Can't open input file %s!\n see warnings() and restart R", 1, filename);

     }

   patfile >> pattern;

   patfile.close();

@@ -109,8 +116,9 @@ void save_pattern(integer_matrix& pattern, char *filestem)

   std::ofstream patfile(filename);

   if (! patfile)

     {

-      std::cerr << "Can't open output file -- " << filename << std::endl;

-      exit(1);

+      //std::cerr << "Can't open output file -- " << filename << std::endl;

+      //exit(1);

+	  Rf_error("internal: mtreemix invoked 'exit(%d)'\n Can't open output file %s!\n see warnings() and restart R", 1, filename);

     }

   patfile << pattern;

   patfile.close();

@@ -147,7 +155,8 @@ matrix pair_probs(integer_matrix& pat, vector& resp)

 	if (count == 0)  // no data in the column pair (j1,j2)

 	  {

-	    std::cerr << "Warning: No data in column pair (" << j1 << ", " << j2 << ")! Assuming independence." << std::endl;

+	    //std::cerr << "Warning: No data in column pair (" << j1 << ", " << j2 << ")! Assuming independence." << std::endl;

+		Rprintf("Warning: No data in column pair (%d, %d)! Assuming independence!\n", j1, j2);

 	    wcount = P(0,j1) * P(0,j2);  // assuming independence

 	  }

@@ -10,6 +10,9 @@

 #include "include/mtree.h"

 #include "include/mtreemix.h"

+//R includes

+#include <R.h>

+#include <Rdefines.h>

 vector event_freq(integer_matrix& pat)

 {

@@ -24,8 +27,9 @@ vector event_freq(integer_matrix& pat)

       freq[j] = nonnegmean(col);  // == rel. frequency

       if (freq[j] < 0.0)  // no data in this column!

 	{

-	  std::cerr << "No data in column " << j << " !" << std::endl;

-	  exit(1);

+	  //std::cerr << "No data in column " << j << " !" << std::endl;

+	  //exit(1);	

+	  Rf_error("internal: mtreemix invoked 'exit(%d)'\n No data in column %2d!\n see warnings() and restart R", 1, j);

 	}

     }

@@ -460,11 +464,12 @@ double mtreemix_EM(array<string>& profile, integer_matrix& pattern, int K, int M

 	  double sum = oneK * wlike.row(i);  // sum of weighted likelihoods

 	  if (sum <= 0.0)

 	    {

-	      std::cerr << "EM aborted. Sample no. " << i + 1

-			<< " [" << pat_hat.row(i) << "] "

-			<< "has likelihood zero!" << std::endl;

+	      //std::cerr << "EM aborted. Sample no. " << i + 1

+			//<< " [" << pat_hat.row(i) << "] "

+			//<< "has likelihood zero!" << std::endl;

 	      // mtreemix_save(alpha, G, cond_prob, node_no, "Lzero");  // save model for diagnostics

-	      exit(1);

+	      //exit(1);

+		  Rf_error("internal: mtreemix invoked 'exit(%d)'\n EM aborted. Sample no. %2d has likelihood zero!\n see warnings() and restart R", 1, i + 1);

 	    }

 	  for (int k=0; k<K; k++)

@@ -589,11 +594,12 @@ double mtreemix_E_step(integer_matrix& pattern, int K, vector& alpha, array< gra

 	  double sum = oneK * wlike.row(i);  // sum of weighted likelihoods

 	  if (sum <= 0.0)

 	    {

-	      std::cerr << "E-step aborted. Sample no. " << i + 1

-			<< " [" << pat_hat.row(i) << "] "

-			<< "has likelihood zero!" << std::endl;

+	      //std::cerr << "E-step aborted. Sample no. " << i + 1

+			//<< " [" << pat_hat.row(i) << "] "

+		//	<< "has likelihood zero!" << std::endl;

 	      // mtreemix_save(alpha, G, cond_prob, node_no, "Lzero");  // save model for diagnostics

-	      exit(1);

+	      //exit(1);

+		  Rf_error("internal: mtreemix invoked 'exit(%d)'\n EM aborted. Sample no. %2d has likelihood zero!\n see warnings() and restart R", 1, i + 1);

 	    }

 	  for (int k=0; k<K; k++)

@@ -623,7 +629,8 @@ double mtreemix_loglike(integer_matrix& pattern, int K, vector& alpha, array<gra

       if (sum <= 0.0)

 	{

-	  std::cerr << "Warning: The sample: [" << pattern.row(i) << "] has likelihood zero!" << std::endl;

+	  //std::cerr << "Warning: The sample: [" << pattern.row(i) << "] has likelihood zero!" << std::endl;

+	  Rprintf("Warning: Sample no. %2d has likelihood zero!", i);

 	}

       logL += log(sum);

@@ -733,8 +740,9 @@ void mtreemix_save(vector& alpha, array< graph >& G, array< map<edge,double> >&

   std::ofstream mtreemix(filename);

   if (! mtreemix)

     {

-      std::cerr << "Can't open output file -- " << filename << std::endl;

-      exit(1);

+      //std::cerr << "Can't open output file -- " << filename << std::endl;

+      //exit(1);

+	  Rf_error("internal: mtreemix invoked 'exit(%d)'\n Can't open output file %s!\n see warnings() and restart R", 1, filename);

     }

   mtreemix << alpha << std::endl;

@@ -766,8 +774,9 @@ array<string> mtreemix_load(vector& alpha, array< graph >& G, array< map<node,st

   std::ifstream mtreemix(filename);

   if (! mtreemix)

     {

-      std::cerr << "Can't open input file -- " << filename << std::endl;

-      exit(1);

+      //std::cerr << "Can't open input file -- " << filename << std::endl;

+      //exit(1);

+	  Rf_error("internal: mtreemix invoked 'exit(%d)'\n Can't open input file %s!\n see warnings() and restart R", 1, filename);

     }

   mtreemix >> alpha >> std::ws;

@@ -880,8 +889,9 @@ array< map<edge,double> > waiting_times(array< map<edge,double> >& cond_prob, in

       break;

     default :

-      std::cerr << "Unknown sampling_mode -- " << sampling_mode << std::endl;

-      exit(1);

+      //std::cerr << "Unknown sampling_mode -- " << sampling_mode << std::endl;

+      //exit(1);

+	  Rf_error("internal: mtreemix invoked 'exit(%d)'\n Unknown sampling mode %2d!\n see warnings() and restart R", 1, sampling_mode);

     }

   return lambda;

 }

@@ -4,6 +4,10 @@

 #include <cstdarg>

 #include <sstream>

+//R includes

+#include <R.h>

+#include <Rdefines.h>

+

 //using namespace replaceleda;

 //template<class T>

@@ -364,9 +368,10 @@ void replaceleda::printGraph (replaceleda::graph &g, edge_array<double> &weights

    node v;

     edge e;

-    std::cerr << "#nodes: " << g.number_of_nodes() << " #edges: " << g.number_of_edges() << std::endl;

+    //std::cerr << "#nodes: " << g.number_of_nodes() << " #edges: " << g.number_of_edges() << std::endl;

+	Rprintf("#nodes %2d #edges %2d\n", g.number_of_nodes(), g.number_of_edges());

     list<node> xxx = g.all_nodes();

-    

+    /*

     forall_nodes(v, g){

 	std::cerr << v << " " << v->getIndex() << std::endl;

 	std::cerr << "(" << g.indeg(v) << "," << g.outdeg(v) << "," << g.degree(v) << "):" << std::endl;

@@ -376,7 +381,7 @@ void replaceleda::printGraph (replaceleda::graph &g, edge_array<double> &weights

 	    std::cerr << v->getIndex() << " -" << weights[e] << "-> " << t->getIndex() << std::endl; 

 	}

     }

-

+	*/

 }