>>>>>>>
>>>>>>> INSTALLATION WITH 'R CMD INSTALL --preclean --no-multiarch --library=Rtreemix.buildbin-libdir Rtreemix_1.22.0.tar.gz'
>>>>>>>
* installing *source* package 'Rtreemix' ...
** libs
clang++ -I/Library/Frameworks/R.framework/Resources/include -DNDEBUG -I/usr/local/include -fPIC -mtune=native -g -O2 -Wall -pedantic -Wconversion -c Rtreemix.cc -o Rtreemix.o
In file included from Rtreemix.cc:3:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
./include/Graph.hh:79:48: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
node getNode(uint n){ return mynodes.get_item(n);}
˜˜˜˜˜˜˜ ^
./include/Graph.hh:81:30: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint outdeg(node n){ return n->out_edges().size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:84:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
return n->in_edges().size();
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:88:30: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint degree(node n){ return n->adj_edges().size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:167:48: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
edge getEdge(uint e){ return myedges.get_item(e);}
˜˜˜˜˜˜˜ ^
./include/Graph.hh:180:33: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint number_of_nodes() {return mynodes.size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:181:33: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint number_of_edges() {return myedges.size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:207:57: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
for(uint kcount = 0; ce = (*cn)->out_edges().get_item(kcount), kcount < (*cn)->out_edges().size(); ++kcount)
˜ ^˜˜˜˜˜
Rtreemix.cc:51:15: warning: 'C_get_profile' has C-linkage specified, but returns incomplete type 'array<string>' which could be incompatible with C [-Wreturn-type-c-linkage]
array<string> C_get_profile(SEXP R_events);
^
Rtreemix.cc:53:16: warning: 'C_get_pattern' has C-linkage specified, but returns incomplete type 'integer_matrix' (aka 'mmatrix<int>') which could be incompatible with C [-Wreturn-type-c-linkage]
integer_matrix C_get_pattern(SEXP R_mat);
^
Rtreemix.cc:141:15: warning: 'C_get_profile' has C-linkage specified, but returns incomplete type 'array<string>' which could be incompatible with C [-Wreturn-type-c-linkage]
array<string> C_get_profile(SEXP R_events) {
^
Rtreemix.cc:149:27: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array<string> C_profile(L);
˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:163:15: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
C_profile[i] = string (CHAR(STRING_ELT(R_events, i)));
˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:185:16: warning: 'C_get_pattern' has C-linkage specified, but returns incomplete type 'integer_matrix' (aka 'mmatrix<int>') which could be incompatible with C [-Wreturn-type-c-linkage]
integer_matrix C_get_pattern(SEXP R_mat) {
^
Rtreemix.cc:207:24: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix C_mat(nrows, ncols);
˜˜˜˜˜ ^˜˜˜˜
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:1049:17: note: expanded from macro 'nrows'
#define nrows Rf_nrows
^˜˜˜˜˜˜˜
Rtreemix.cc:207:31: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix C_mat(nrows, ncols);
˜˜˜˜˜ ^˜˜˜˜
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:1046:17: note: expanded from macro 'ncols'
#define ncols Rf_ncols
^˜˜˜˜˜˜˜
Rtreemix.cc:217:13: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
C_mat[i][j] = R_INT_MATRIX(R_mat, i, j);
˜˜˜˜˜ ^
Rtreemix.cc:217:16: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
C_mat[i][j] = R_INT_MATRIX(R_mat, i, j);
˜˜˜˜˜ ^
Rtreemix.cc:253:49: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
INTEGER(R_mat)[i + j*C_mat.dim1()]= C_mat[i][j];
˜˜˜˜˜ ^
Rtreemix.cc:253:52: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
INTEGER(R_mat)[i + j*C_mat.dim1()]= C_mat[i][j];
˜˜˜˜˜ ^
Rtreemix.cc:277:22: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix pat(pow2(L-1), L);
˜˜˜ ^˜˜˜˜˜˜˜˜
Rtreemix.cc:277:33: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix pat(pow2(L-1), L);
˜˜˜ ^
Rtreemix.cc:283:9: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[i] = index2pattern(i, L);
˜˜˜ ^
Rtreemix.cc:309:46: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
REAL(R_mat)[i + j*C_mat.dim1()]= C_mat[i][j];
˜˜˜˜˜ ^
Rtreemix.cc:309:49: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
REAL(R_mat)[i + j*C_mat.dim1()]= C_mat[i][j];
˜˜˜˜˜ ^
Rtreemix.cc:425:36: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector alpha(K); // mixture parameter
˜˜˜˜˜ ^
Rtreemix.cc:427:32: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< graph > G(K); // digraph
˜ ^
Rtreemix.cc:429:38: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< map<int,node> > node_no(K); // node of mutation index
˜˜˜˜˜˜˜ ^
Rtreemix.cc:431:36: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< map<node,string> > event(K); // substitution event
˜˜˜˜˜ ^
Rtreemix.cc:433:40: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< map<edge,double> > cond_prob(K); // conditional probabilities
˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:435:38: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix pat_hat(pattern.dim1(), pattern.dim2()); // estimated full data
˜˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:435:54: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix pat_hat(pattern.dim1(), pattern.dim2()); // estimated full data
˜˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:437:35: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix resp(K, pattern.dim1()); // responsibilities
˜˜˜˜ ^
Rtreemix.cc:437:38: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix resp(K, pattern.dim1()); // responsibilities
˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:552:17: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
num_nodes = G[k].number_of_nodes();
˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:552:19: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
num_nodes = G[k].number_of_nodes();
˜ ^
Rtreemix.cc:554:17: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
num_edges = G[k].number_of_edges();
˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:554:19: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
num_edges = G[k].number_of_edges();
˜ ^
Rtreemix.cc:596:7: warning: expression result unused [-Wunused-value]
forall_nodes (n, G[k]) {
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
Rtreemix.cc:596:26: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_nodes (n, G[k]) {
˜ ^
./include/Graph.hh:16:57: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
^
Rtreemix.cc:596:26: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_nodes (n, G[k]) {
˜ ^
./include/Graph.hh:16:84: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
^
Rtreemix.cc:598:60: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
SET_STRING_ELT(graphN, j, STRING_ELT(R_scalarString(event[k][n].c_str()), 0));
˜˜˜˜˜ ^
Rtreemix.cc:606:7: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
if(G[k].outdeg(n) == 0) {
˜ ^
Rtreemix.cc:618:45: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
PROTECT(curEdges = allocVector(INTSXP, G[k].outdeg(n)));
˜ ^
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:547:31: note: expanded from macro 'PROTECT'
#define PROTECT(s) Rf_protect(s)
^
Rtreemix.cc:624:48: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
PROTECT(curWeights = allocVector(REALSXP, G[k].outdeg(n)));
˜ ^
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:547:31: note: expanded from macro 'PROTECT'
#define PROTECT(s) Rf_protect(s)
^
Rtreemix.cc:630:4: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e, n) {
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
Rtreemix.cc:634:39: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
STRING_ELT(R_scalarString((event[k][n] + "|"
˜˜˜˜˜ ^
Rtreemix.cc:636:20: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
+ event[k][G[k].target(e)]).c_str()), 0));
˜˜˜˜˜ ^
Rtreemix.cc:636:25: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
+ event[k][G[k].target(e)]).c_str()), 0));
˜ ^
Rtreemix.cc:646:37: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
REAL (edWeights)[0] = cond_prob[k][e];
˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:660:42: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
INTEGER (curEdges)[curEl] = (int) (G[k].target(e)->getIndex()) + 1;
˜ ^
Rtreemix.cc:662:42: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
REAL (curWeights)[curEl] = cond_prob[k][e];
˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:788:15: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector resp(pattern.dim1());
˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:792:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
resp[i] = 1.0;
˜˜˜˜ ^
Rtreemix.cc:894:17: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
num_nodes = G[k].number_of_nodes();
˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:894:19: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
num_nodes = G[k].number_of_nodes();
˜ ^
Rtreemix.cc:896:17: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
num_edges = G[k].number_of_edges();
˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:896:19: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
num_edges = G[k].number_of_edges();
˜ ^
Rtreemix.cc:938:7: warning: expression result unused [-Wunused-value]
forall_nodes (n, G[k]) {
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
Rtreemix.cc:938:26: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_nodes (n, G[k]) {
˜ ^
./include/Graph.hh:16:57: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
^
Rtreemix.cc:938:26: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_nodes (n, G[k]) {
˜ ^
./include/Graph.hh:16:84: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
^
Rtreemix.cc:940:60: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
SET_STRING_ELT(graphN, j, STRING_ELT(R_scalarString(event[k][n].c_str()), 0));
˜˜˜˜˜ ^
Rtreemix.cc:948:7: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
if(G[k].outdeg(n) == 0) {
˜ ^
Rtreemix.cc:960:45: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
PROTECT(curEdges = allocVector(INTSXP, G[k].outdeg(n)));
˜ ^
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:547:31: note: expanded from macro 'PROTECT'
#define PROTECT(s) Rf_protect(s)
^
Rtreemix.cc:966:48: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
PROTECT(curWeights = allocVector(REALSXP, G[k].outdeg(n)));
˜ ^
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:547:31: note: expanded from macro 'PROTECT'
#define PROTECT(s) Rf_protect(s)
^
Rtreemix.cc:970:4: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e, n) {
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
Rtreemix.cc:974:39: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
STRING_ELT(R_scalarString((event[k][n] + "|"
˜˜˜˜˜ ^
Rtreemix.cc:976:20: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
+ event[k][G[k].target(e)]).c_str()), 0));
˜˜˜˜˜ ^
Rtreemix.cc:976:25: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
+ event[k][G[k].target(e)]).c_str()), 0));
˜ ^
Rtreemix.cc:986:37: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
REAL (edWeights)[0] = cond_prob[k][e];
˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:998:42: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
INTEGER (curEdges)[curEl] = (int) (G[k].target(e)->getIndex()) + 1;
˜ ^
Rtreemix.cc:1000:42: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
REAL (curWeights)[curEl] = cond_prob[k][e];
˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:1130:15: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector resp(pattern.dim1());
˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:1134:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
resp[i] = 1.0;
˜˜˜˜ ^
Rtreemix.cc:1237:17: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
num_nodes = G[k].number_of_nodes();
˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:1237:19: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
num_nodes = G[k].number_of_nodes();
˜ ^
Rtreemix.cc:1239:17: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
num_edges = G[k].number_of_edges();
˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:1239:19: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
num_edges = G[k].number_of_edges();
˜ ^
Rtreemix.cc:1281:7: warning: expression result unused [-Wunused-value]
forall_nodes (n, G[k]) {
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
Rtreemix.cc:1281:26: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_nodes (n, G[k]) {
˜ ^
./include/Graph.hh:16:57: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
^
Rtreemix.cc:1281:26: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_nodes (n, G[k]) {
˜ ^
./include/Graph.hh:16:84: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
^
Rtreemix.cc:1283:60: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
SET_STRING_ELT(graphN, j, STRING_ELT(R_scalarString(event[k][n].c_str()), 0));
˜˜˜˜˜ ^
Rtreemix.cc:1291:7: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
if(G[k].outdeg(n) == 0) {
˜ ^
Rtreemix.cc:1303:45: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
PROTECT(curEdges = allocVector(INTSXP, G[k].outdeg(n)));
˜ ^
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:547:31: note: expanded from macro 'PROTECT'
#define PROTECT(s) Rf_protect(s)
^
Rtreemix.cc:1309:48: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
PROTECT(curWeights = allocVector(REALSXP, G[k].outdeg(n)));
˜ ^
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:547:31: note: expanded from macro 'PROTECT'
#define PROTECT(s) Rf_protect(s)
^
Rtreemix.cc:1313:4: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e, n) {
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
Rtreemix.cc:1317:39: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
STRING_ELT(R_scalarString((event[k][n] + "|"
˜˜˜˜˜ ^
Rtreemix.cc:1319:20: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
+ event[k][G[k].target(e)]).c_str()), 0));
˜˜˜˜˜ ^
Rtreemix.cc:1319:25: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
+ event[k][G[k].target(e)]).c_str()), 0));
˜ ^
Rtreemix.cc:1329:37: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
REAL (edWeights)[0] = cond_prob[k][e];
˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:1341:42: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
INTEGER (curEdges)[curEl] = (int) (G[k].target(e)->getIndex()) + 1;
˜ ^
Rtreemix.cc:1343:42: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
REAL (curWeights)[curEl] = cond_prob[k][e];
˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:1487:36: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector alpha(K); // mixture parameter
˜˜˜˜˜ ^
Rtreemix.cc:1489:32: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< graph > G(K); // digraph
˜ ^
Rtreemix.cc:1491:38: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< map<int,node> > node_no(K); // node of mutation index
˜˜˜˜˜˜˜ ^
Rtreemix.cc:1493:36: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< map<node,string> > event(K); // substitution event
˜˜˜˜˜ ^
Rtreemix.cc:1495:40: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< map<edge,double> > cond_prob(K); // conditional probabilities
˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:1497:38: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix pat_hat(pattern.dim1(), pattern.dim2()); // estimated full data
˜˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:1497:54: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix pat_hat(pattern.dim1(), pattern.dim2()); // estimated full data
˜˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:1499:35: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix resp(K, pattern.dim1()); // responsibilities
˜˜˜˜ ^
Rtreemix.cc:1499:38: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix resp(K, pattern.dim1()); // responsibilities
˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:1513:35: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< map<edge,double> > lower(K); // lower bound of CI for cond_prob
˜˜˜˜˜ ^
Rtreemix.cc:1515:35: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< map<edge,double> > upper(K); // upper bound of CI for cond_prob
˜˜˜˜˜ ^
Rtreemix.cc:1517:22: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector alpha_lower(K), alpha_upper(K); // CI for alpha
˜˜˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:1517:38: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector alpha_lower(K), alpha_upper(K); // CI for alpha
˜˜˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:1655:39: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
REAL (alphaVec) [0] = alpha_lower[k];
˜˜˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:1657:39: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
REAL (alphaVec) [1] = alpha_upper[k];
˜˜˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:1684:17: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
num_nodes = G[k].number_of_nodes();
˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:1684:19: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
num_nodes = G[k].number_of_nodes();
˜ ^
Rtreemix.cc:1686:17: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
num_edges = G[k].number_of_edges();
˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:1686:19: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
num_edges = G[k].number_of_edges();
˜ ^
Rtreemix.cc:1728:7: warning: expression result unused [-Wunused-value]
forall_nodes (n, G[k]) {
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
Rtreemix.cc:1728:26: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_nodes (n, G[k]) {
˜ ^
./include/Graph.hh:16:57: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
^
Rtreemix.cc:1728:26: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_nodes (n, G[k]) {
˜ ^
./include/Graph.hh:16:84: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
^
Rtreemix.cc:1730:60: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
SET_STRING_ELT(graphN, j, STRING_ELT(R_scalarString(event[k][n].c_str()), 0));
˜˜˜˜˜ ^
Rtreemix.cc:1738:7: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
if(G[k].outdeg(n) == 0) {
˜ ^
Rtreemix.cc:1750:45: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
PROTECT(curEdges = allocVector(INTSXP, G[k].outdeg(n)));
˜ ^
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:547:31: note: expanded from macro 'PROTECT'
#define PROTECT(s) Rf_protect(s)
^
Rtreemix.cc:1756:48: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
PROTECT(curWeights = allocVector(REALSXP, G[k].outdeg(n)));
˜ ^
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:547:31: note: expanded from macro 'PROTECT'
#define PROTECT(s) Rf_protect(s)
^
Rtreemix.cc:1760:4: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e, n) {
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
Rtreemix.cc:1764:39: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
STRING_ELT(R_scalarString((event[k][n] + "|"
˜˜˜˜˜ ^
Rtreemix.cc:1766:20: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
+ event[k][G[k].target(e)]).c_str()), 0));
˜˜˜˜˜ ^
Rtreemix.cc:1766:25: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
+ event[k][G[k].target(e)]).c_str()), 0));
˜ ^
Rtreemix.cc:1778:37: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
REAL (edWeights)[0] = cond_prob[k][e];
˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:1786:28: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
REAL (edCI)[0] = lower[k][e];
˜˜˜˜˜ ^
Rtreemix.cc:1788:28: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
REAL (edCI)[1] = upper[k][e];
˜˜˜˜˜ ^
Rtreemix.cc:1790:27: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
REAL (edCI)[2] = supp[k][e];
˜˜˜˜ ^
Rtreemix.cc:1806:42: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
INTEGER (curEdges)[curEl] = (int) (G[k].target(e)->getIndex()) + 1;
˜ ^
Rtreemix.cc:1808:42: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
REAL (curWeights)[curEl] = cond_prob[k][e];
˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:1950:12: warning: implicit conversion changes signedness: 'R_len_t' (aka 'int') to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
G.resize(length(listG));
˜ ^˜˜˜˜˜˜˜˜˜˜˜˜
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:1029:20: note: expanded from macro 'length'
#define length(x) Rf_length(x)
^˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:1952:16: warning: implicit conversion changes signedness: 'R_len_t' (aka 'int') to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
event.resize(length(listG));
˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:1029:20: note: expanded from macro 'length'
#define length(x) Rf_length(x)
^˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:1954:20: warning: implicit conversion changes signedness: 'R_len_t' (aka 'int') to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cond_prob.resize(length(listG));
˜˜˜˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:1029:20: note: expanded from macro 'length'
#define length(x) Rf_length(x)
^˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:1956:18: warning: implicit conversion changes signedness: 'R_len_t' (aka 'int') to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
node_no.resize(length(listG));
˜˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:1029:20: note: expanded from macro 'length'
#define length(x) Rf_length(x)
^˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:1962:11: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
alpha[k] = REAL (R_alpha)[k]; // get the weights of the tree components
˜˜˜˜˜ ^
Rtreemix.cc:1976:13: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
node_no[k].clear();
˜˜˜˜˜˜˜ ^
Rtreemix.cc:1978:11: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
event[k].clear();
˜˜˜˜˜ ^
Rtreemix.cc:1982:13: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
v = G[k].new_node();
˜ ^
Rtreemix.cc:1984:13: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
event[k][v] = string (CHAR(STRING_ELT(gN, l)));
˜˜˜˜˜ ^
Rtreemix.cc:1986:15: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
node_no[k][l] = v;
˜˜˜˜˜˜˜ ^
Rtreemix.cc:1996:15: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cond_prob[k].clear();
˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:2012:10: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
e = G[k].new_edge(G[k].getNode(i), G[k].getNode(get_index(gN, CHAR(STRING_ELT(names, j)))));
˜ ^
Rtreemix.cc:2012:24: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
e = G[k].new_edge(G[k].getNode(i), G[k].getNode(get_index(gN, CHAR(STRING_ELT(names, j)))));
˜ ^
Rtreemix.cc:2012:35: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
e = G[k].new_edge(G[k].getNode(i), G[k].getNode(get_index(gN, CHAR(STRING_ELT(names, j)))));
˜ ^
Rtreemix.cc:2012:41: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
e = G[k].new_edge(G[k].getNode(i), G[k].getNode(get_index(gN, CHAR(STRING_ELT(names, j)))));
˜ ^
Rtreemix.cc:2012:52: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
e = G[k].new_edge(G[k].getNode(i), G[k].getNode(get_index(gN, CHAR(STRING_ELT(names, j)))));
˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:2014:14: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cond_prob[k][e] = REAL(ew)[j];
˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:2068:16: warning: implicit conversion changes signedness: 'R_len_t' (aka 'int') to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector alpha(length(R_trees)); // mixture parameter
˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:1029:20: note: expanded from macro 'length'
#define length(x) Rf_length(x)
^˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:2132:16: warning: implicit conversion changes signedness: 'R_len_t' (aka 'int') to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector alpha(length(R_trees)); // mixture parameter
˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:1029:20: note: expanded from macro 'length'
#define length(x) Rf_length(x)
^˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:2158:26: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix pattern(n, L); // simulated patterns,
˜˜˜˜˜˜˜ ^
Rtreemix.cc:2158:29: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix pattern(n, L); // simulated patterns,
˜˜˜˜˜˜˜ ^
Rtreemix.cc:2160:16: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector wtime(n); // their waiting times,
˜˜˜˜˜ ^
Rtreemix.cc:2162:16: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector stime(n); // and their sampling times
˜˜˜˜˜ ^
Rtreemix.cc:2246:16: warning: implicit conversion changes signedness: 'R_len_t' (aka 'int') to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector alpha(length(R_trees)); // mixture parameter
˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:1029:20: note: expanded from macro 'length'
#define length(x) Rf_length(x)
^˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:2264:37: warning: implicit conversion changes signedness: 'R_len_t' (aka 'int') to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< map<node,int> > no_of_node(length(R_trees));
˜˜˜˜˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:1029:20: note: expanded from macro 'length'
#define length(x) Rf_length(x)
^˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:2270:18: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
no_of_node[k][node_no[k][j]] = j;
˜˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:2270:29: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
no_of_node[k][node_no[k][j]] = j;
˜˜˜˜˜˜˜ ^
Rtreemix.cc:2292:54: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
array< list<double> > wtime = mtreemix_time(L, G[k], lambda[k],
˜ ^
Rtreemix.cc:2292:65: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
array< list<double> > wtime = mtreemix_time(L, G[k], lambda[k],
˜˜˜˜˜˜ ^
Rtreemix.cc:2294:14: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
node_no[k], no_of_node[k], cond_prob[k], n);
˜˜˜˜˜˜˜ ^
Rtreemix.cc:2294:29: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
node_no[k], no_of_node[k], cond_prob[k], n);
˜˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:2294:43: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
node_no[k], no_of_node[k], cond_prob[k], n);
˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:2306:45: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
REAL (R_wtime_comp) [i] = nonnegmean(wtime[i]);
˜˜˜˜˜ ^
Rtreemix.cc:2322:22: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix pat(pow2(L-1), L);
˜˜˜ ^˜˜˜˜˜˜˜˜
Rtreemix.cc:2322:33: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix pat(pow2(L-1), L);
˜˜˜ ^
Rtreemix.cc:2328:11: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[i] = index2pattern(i, L);
˜˜˜ ^
Rtreemix.cc:2370:16: warning: implicit conversion changes signedness: 'R_len_t' (aka 'int') to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector alpha(length(R_trees)); // mixture parameter
˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:1029:20: note: expanded from macro 'length'
#define length(x) Rf_length(x)
^˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:2388:15: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector logL(N);
˜˜˜˜ ^
Rtreemix.cc:2390:16: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix wlike(N,length(R_trees));
˜˜˜˜˜ ^
Rtreemix.cc:2390:18: warning: implicit conversion changes signedness: 'R_len_t' (aka 'int') to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix wlike(N,length(R_trees));
˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:1029:20: note: expanded from macro 'length'
#define length(x) Rf_length(x)
^˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:2398:28: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix pat(1,L);
˜˜˜ ^
Rtreemix.cc:2402:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat(0,j) = pattern(i,j);
˜˜˜ ^
Rtreemix.cc:2402:21: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat(0,j) = pattern(i,j);
˜˜˜˜˜˜˜ ^
Rtreemix.cc:2402:23: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat(0,j) = pattern(i,j);
˜˜˜˜˜˜˜ ^
Rtreemix.cc:2408:12: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
logL[i] = mtreemix_loglike(pat, length(R_trees), alpha, G, node_no, cond_prob);
˜˜˜˜ ^
Rtreemix.cc:2416:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat.row(0), G[k], node_no[k], cond_prob[k]);
˜˜˜˜˜ ^
Rtreemix.cc:2416:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat.row(0), G[k], node_no[k], cond_prob[k]);
˜˜˜˜˜ ^
Rtreemix.cc:2416:21: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat.row(0), G[k], node_no[k], cond_prob[k]);
˜˜˜˜˜ ^
Rtreemix.cc:2416:51: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat.row(0), G[k], node_no[k], cond_prob[k]);
˜ ^
Rtreemix.cc:2416:63: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat.row(0), G[k], node_no[k], cond_prob[k]);
˜˜˜˜˜˜˜ ^
Rtreemix.cc:2416:77: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat.row(0), G[k], node_no[k], cond_prob[k]);
˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:2478:36: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector alpha(K); // mixture parameter
˜˜˜˜˜ ^
Rtreemix.cc:2480:32: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< graph > G(K); // digraph
˜ ^
Rtreemix.cc:2482:38: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< map<int,node> > node_no(K); // node of mutation index
˜˜˜˜˜˜˜ ^
Rtreemix.cc:2484:36: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< map<node,string> > event(K); // substitution event
˜˜˜˜˜ ^
Rtreemix.cc:2486:40: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< map<edge,double> > cond_prob(K); // conditional probabilities
˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:2585:17: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
num_nodes = G[k].number_of_nodes();
˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:2585:19: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
num_nodes = G[k].number_of_nodes();
˜ ^
Rtreemix.cc:2587:17: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
num_edges = G[k].number_of_edges();
˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:2587:19: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
num_edges = G[k].number_of_edges();
˜ ^
Rtreemix.cc:2629:7: warning: expression result unused [-Wunused-value]
forall_nodes (n, G[k]) {
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
Rtreemix.cc:2629:26: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_nodes (n, G[k]) {
˜ ^
./include/Graph.hh:16:57: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
^
Rtreemix.cc:2629:26: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_nodes (n, G[k]) {
˜ ^
./include/Graph.hh:16:84: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
^
Rtreemix.cc:2631:67: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
SET_STRING_ELT(graphN, j, STRING_ELT(R_scalarString(("E" + event[k][n]).c_str()), 0));
˜˜˜˜˜ ^
Rtreemix.cc:2639:7: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
if(G[k].outdeg(n) == 0) {
˜ ^
Rtreemix.cc:2651:45: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
PROTECT(curEdges = allocVector(INTSXP, G[k].outdeg(n)));
˜ ^
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:547:31: note: expanded from macro 'PROTECT'
#define PROTECT(s) Rf_protect(s)
^
Rtreemix.cc:2657:48: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
PROTECT(curWeights = allocVector(REALSXP, G[k].outdeg(n)));
˜ ^
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:547:31: note: expanded from macro 'PROTECT'
#define PROTECT(s) Rf_protect(s)
^
Rtreemix.cc:2663:4: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e, n) {
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
Rtreemix.cc:2667:45: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
STRING_ELT(R_scalarString(("E" + event[k][n] + "|"
˜˜˜˜˜ ^
Rtreemix.cc:2669:26: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
+ "E" + event[k][G[k].target(e)]).c_str()), 0));
˜˜˜˜˜ ^
Rtreemix.cc:2669:31: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
+ "E" + event[k][G[k].target(e)]).c_str()), 0));
˜ ^
Rtreemix.cc:2679:37: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
REAL (edWeights)[0] = cond_prob[k][e];
˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:2691:42: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
INTEGER (curEdges)[curEl] = (int) (G[k].target(e)->getIndex()) + 1;
˜ ^
Rtreemix.cc:2693:42: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
REAL (curWeights)[curEl] = cond_prob[k][e];
˜˜˜˜˜˜˜˜˜ ^
Rtreemix.cc:2801:36: warning: implicit conversion changes signedness: 'R_len_t' (aka 'int') to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector alpha(length(R_trees)); // mixture parameter
˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:1029:20: note: expanded from macro 'length'
#define length(x) Rf_length(x)
^˜˜˜˜˜˜˜˜˜˜˜
Rtreemix.cc:2841:22: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix pat(prob.dim(), L);
˜˜˜ ^˜˜˜˜˜˜˜˜˜
Rtreemix.cc:2841:34: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix pat(prob.dim(), L);
˜˜˜ ^
Rtreemix.cc:2849:11: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[i] = index2pattern(i, L);
˜˜˜ ^
Rtreemix.cc:2853:32: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
REAL (R_prob) [i] = prob[i];
˜˜˜˜ ^
In file included from Rtreemix.cc:3:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:53:78: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
T get_item(int pos) {if ((uint)pos < backpoint::size())return backpoint::at(pos); return T(0);}
˜˜˜˜˜˜˜˜˜ ^˜˜
./include/Graph.hh:79:39: note: in instantiation of member function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Node> >::get_item' requested here
node getNode(uint n){ return mynodes.get_item(n);}
^
In file included from Rtreemix.cc:3:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:53:78: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
T get_item(int pos) {if ((uint)pos < backpoint::size())return backpoint::at(pos); return T(0);}
˜˜˜˜˜˜˜˜˜ ^˜˜
./include/Graph.hh:167:39: note: in instantiation of member function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Edge> >::get_item' requested here
edge getEdge(uint e){ return myedges.get_item(e);}
^
In file included from Rtreemix.cc:3:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Matrix.hh:44:13: note: in instantiation of member function 'replaceleda::mvector<int>::push_back' requested here
dummy.push_back(D[c++]);
^
Rtreemix.cc:207:18: note: in instantiation of member function 'replaceleda::mmatrix<int>::mmatrix' requested here
integer_matrix C_mat(nrows, ncols);
^
In file included from Rtreemix.cc:3:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Matrix.hh:45:6: note: in instantiation of member function 'replaceleda::mvector<replaceleda::mvector<int> >::push_back' requested here
mx.push_back(dummy);
^
Rtreemix.cc:207:18: note: in instantiation of member function 'replaceleda::mmatrix<int>::mmatrix' requested here
integer_matrix C_mat(nrows, ncols);
^
In file included from Rtreemix.cc:3:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:147:21: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim1(){ return N; }
˜˜˜˜˜˜ ^
Rtreemix.cc:245:45: note: in instantiation of member function 'replaceleda::mmatrix<int>::dim1' requested here
PROTECT(R_mat = allocMatrix(INTSXP, C_mat.dim1(), C_mat.dim2()));
^
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:547:31: note: expanded from macro 'PROTECT'
#define PROTECT(s) Rf_protect(s)
^
In file included from Rtreemix.cc:3:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:148:21: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim2(){ return M; }
˜˜˜˜˜˜ ^
Rtreemix.cc:245:59: note: in instantiation of member function 'replaceleda::mmatrix<int>::dim2' requested here
PROTECT(R_mat = allocMatrix(INTSXP, C_mat.dim1(), C_mat.dim2()));
^
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:547:31: note: expanded from macro 'PROTECT'
#define PROTECT(s) Rf_protect(s)
^
In file included from Rtreemix.cc:3:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:33:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
D = v2.dim();
˜ ^˜˜˜˜˜˜˜
Rtreemix.cc:283:12: note: in instantiation of member function 'replaceleda::mvector<int>::operator=' requested here
pat[i] = index2pattern(i, L);
^
In file included from Rtreemix.cc:3:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:110:20: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim(){ return D;}
˜˜˜˜˜˜ ^
./include/Vector.hh:33:13: note: in instantiation of member function 'replaceleda::mvector<int>::dim' requested here
D = v2.dim();
^
Rtreemix.cc:283:12: note: in instantiation of member function 'replaceleda::mvector<int>::operator=' requested here
pat[i] = index2pattern(i, L);
^
In file included from Rtreemix.cc:3:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:147:21: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim1(){ return N; }
˜˜˜˜˜˜ ^
Rtreemix.cc:301:46: note: in instantiation of member function 'replaceleda::mmatrix<double>::dim1' requested here
PROTECT(R_mat = allocMatrix(REALSXP, C_mat.dim1(), C_mat.dim2()));
^
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:547:31: note: expanded from macro 'PROTECT'
#define PROTECT(s) Rf_protect(s)
^
In file included from Rtreemix.cc:3:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:148:21: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim2(){ return M; }
˜˜˜˜˜˜ ^
Rtreemix.cc:301:60: note: in instantiation of member function 'replaceleda::mmatrix<double>::dim2' requested here
PROTECT(R_mat = allocMatrix(REALSXP, C_mat.dim1(), C_mat.dim2()));
^
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:547:31: note: expanded from macro 'PROTECT'
#define PROTECT(s) Rf_protect(s)
^
In file included from Rtreemix.cc:3:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:33:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
D = v2.dim();
˜ ^˜˜˜˜˜˜˜
/usr/include/c++/4.2.1/bits/stl_algobase.h:433:18: note: in instantiation of member function 'replaceleda::mvector<double>::operator=' requested here
*--__result = *--__last;
^
/usr/include/c++/4.2.1/bits/stl_algobase.h:463:14: note: in instantiation of function template specialization 'std::__copy_backward<false, std::random_access_iterator_tag>::__copy_b<replaceleda::mvector<double> *, replaceleda::mvector<double> *>' requested here
return std::__copy_backward<__simple, _Category>::__copy_b(__first,
^
/usr/include/c++/4.2.1/bits/stl_algobase.h:474:18: note: in instantiation of function template specialization 'std::__copy_backward_aux<replaceleda::mvector<double> *, replaceleda::mvector<double> *>' requested here
{ return std::__copy_backward_aux(__first, __last, __result); }
^
/usr/include/c++/4.2.1/bits/stl_algobase.h:538:14: note: in instantiation of function template specialization 'std::__copy_backward_normal<false, false>::__copy_b_n<replaceleda::mvector<double> *, replaceleda::mvector<double> *>' requested here
return std::__copy_backward_normal<__bi1, __bi2>::__copy_b_n(__first,
^
/usr/include/c++/4.2.1/bits/vector.tcc:324:5: note: in instantiation of function template specialization 'std::copy_backward<replaceleda::mvector<double> *, replaceleda::mvector<double> *>' requested here
std::copy_backward(__position.base(), __old_finish - __n,
^
/usr/include/c++/4.2.1/bits/stl_vector.h:656:9: note: in instantiation of member function 'std::vector<replaceleda::mvector<double>, std::allocator<replaceleda::mvector<double> > >::_M_fill_insert' requested here
{ _M_fill_insert(__position, __n, __x); }
^
/usr/include/c++/4.2.1/bits/stl_vector.h:424:4: note: in instantiation of member function 'std::vector<replaceleda::mvector<double>, std::allocator<replaceleda::mvector<double> > >::insert' requested here
insert(end(), __new_size - size(), __x);
^
./include/Vector.hh:13:22: note: in instantiation of member function 'std::vector<replaceleda::mvector<double>, std::allocator<replaceleda::mvector<double> > >::resize' requested here
mvector(): D(0) { v.resize(0);}
^
./include/Matrix.hh:38:2: note: in instantiation of member function 'replaceleda::mvector<replaceleda::mvector<double> >::mvector' requested here
mmatrix(uint n, uint m) : N(n), M(m) {
^
Rtreemix.cc:437:30: note: in instantiation of member function 'replaceleda::mmatrix<double>::mmatrix' requested here
matrix resp(K, pattern.dim1()); // responsibilities
^
In file included from Rtreemix.cc:3:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Matrix.hh:44:13: note: in instantiation of member function 'replaceleda::mvector<double>::push_back' requested here
dummy.push_back(D[c++]);
^
Rtreemix.cc:437:30: note: in instantiation of member function 'replaceleda::mmatrix<double>::mmatrix' requested here
matrix resp(K, pattern.dim1()); // responsibilities
^
In file included from Rtreemix.cc:3:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Matrix.hh:45:6: note: in instantiation of member function 'replaceleda::mvector<replaceleda::mvector<double> >::push_back' requested here
mx.push_back(dummy);
^
Rtreemix.cc:437:30: note: in instantiation of member function 'replaceleda::mmatrix<double>::mmatrix' requested here
matrix resp(K, pattern.dim1()); // responsibilities
^
In file included from Rtreemix.cc:3:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:110:20: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim(){ return D;}
˜˜˜˜˜˜ ^
Rtreemix.cc:2837:46: note: in instantiation of member function 'replaceleda::mvector<double>::dim' requested here
PROTECT(R_prob = allocVector(REALSXP, prob.dim()));
^
/Library/Frameworks/R.framework/Resources/include/Rinternals.h:547:31: note: expanded from macro 'PROTECT'
#define PROTECT(s) Rf_protect(s)
^
221 warnings generated.
clang++ -I/Library/Frameworks/R.framework/Resources/include -DNDEBUG -I/usr/local/include -fPIC -mtune=native -g -O2 -Wall -pedantic -Wconversion -c WrapGraph.cc -o WrapGraph.o
In file included from WrapGraph.cc:1:
In file included from ./include/replaceleda.hh:7:
./include/Graph.hh:79:48: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
node getNode(uint n){ return mynodes.get_item(n);}
˜˜˜˜˜˜˜ ^
./include/Graph.hh:81:30: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint outdeg(node n){ return n->out_edges().size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:84:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
return n->in_edges().size();
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:88:30: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint degree(node n){ return n->adj_edges().size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:167:48: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
edge getEdge(uint e){ return myedges.get_item(e);}
˜˜˜˜˜˜˜ ^
./include/Graph.hh:180:33: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint number_of_nodes() {return mynodes.size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:181:33: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint number_of_edges() {return myedges.size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:207:57: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
for(uint kcount = 0; ce = (*cn)->out_edges().get_item(kcount), kcount < (*cn)->out_edges().size(); ++kcount)
˜ ^˜˜˜˜˜
In file included from WrapGraph.cc:1:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:53:78: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
T get_item(int pos) {if ((uint)pos < backpoint::size())return backpoint::at(pos); return T(0);}
˜˜˜˜˜˜˜˜˜ ^˜˜
./include/Graph.hh:79:39: note: in instantiation of member function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Node> >::get_item' requested here
node getNode(uint n){ return mynodes.get_item(n);}
^
In file included from WrapGraph.cc:1:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:53:78: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
T get_item(int pos) {if ((uint)pos < backpoint::size())return backpoint::at(pos); return T(0);}
˜˜˜˜˜˜˜˜˜ ^˜˜
./include/Graph.hh:167:39: note: in instantiation of member function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Edge> >::get_item' requested here
edge getEdge(uint e){ return myedges.get_item(e);}
^
10 warnings generated.
clang++ -I/Library/Frameworks/R.framework/Resources/include -DNDEBUG -I/usr/local/include -fPIC -mtune=native -g -O2 -Wall -pedantic -Wconversion -c cfunctions.cc -o cfunctions.o
In file included from cfunctions.cc:10:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
./include/Graph.hh:79:48: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
node getNode(uint n){ return mynodes.get_item(n);}
˜˜˜˜˜˜˜ ^
./include/Graph.hh:81:30: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint outdeg(node n){ return n->out_edges().size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:84:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
return n->in_edges().size();
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:88:30: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint degree(node n){ return n->adj_edges().size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:167:48: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
edge getEdge(uint e){ return myedges.get_item(e);}
˜˜˜˜˜˜˜ ^
./include/Graph.hh:180:33: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint number_of_nodes() {return mynodes.size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:181:33: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint number_of_edges() {return myedges.size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:207:57: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
for(uint kcount = 0; ce = (*cn)->out_edges().get_item(kcount), kcount < (*cn)->out_edges().size(); ++kcount)
˜ ^˜˜˜˜˜
cfunctions.cc:23:20: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_vector x(L);
˜ ^
cfunctions.cc:24:16: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector gamma(K); // responsibility of k-th tree
˜˜˜˜˜ ^
cfunctions.cc:25:20: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix R(S,L);
˜ ^
cfunctions.cc:25:22: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix R(S,L);
˜ ^
cfunctions.cc:32:23: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
x = pattern.row(ri);
˜˜˜˜˜˜˜ ^˜
cfunctions.cc:34:4: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
R(s,j) = x[j];
˜ ^
cfunctions.cc:34:6: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
R(s,j) = x[j];
˜ ^
cfunctions.cc:34:13: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
R(s,j) = x[j];
˜ ^
cfunctions.cc:37:24: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
gamma = resp.col(ri);
˜˜˜˜ ^˜
cfunctions.cc:39:15: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
bresp(k,s) = gamma[k];
˜˜˜˜˜ ^
cfunctions.cc:39:17: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
bresp(k,s) = gamma[k];
˜˜˜˜˜ ^
cfunctions.cc:39:28: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
bresp(k,s) = gamma[k];
˜˜˜˜˜ ^
cfunctions.cc:54:13: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int len = L.length();
˜˜˜ ^˜˜˜˜˜˜˜˜˜
cfunctions.cc:66:26: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
ci[0] = L.contents(lower_index); // lower limit
˜ ^˜˜˜˜˜˜˜˜˜˜
cfunctions.cc:67:26: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
ci[1] = L.contents(upper_index); // upper limit
˜ ^˜˜˜˜˜˜˜˜˜˜
cfunctions.cc:92:37: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< map<node,int> > no_of_node(K);
˜˜˜˜˜˜˜˜˜˜ ^
cfunctions.cc:95:18: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
no_of_node[k][node_no[k][j]] = j;
˜˜˜˜˜˜˜˜˜˜ ^
cfunctions.cc:95:29: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
no_of_node[k][node_no[k][j]] = j;
˜˜˜˜˜˜˜ ^
cfunctions.cc:98:23: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix bpat(N,L); // one bootstrap sample of size N
˜˜˜˜ ^
cfunctions.cc:98:25: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix bpat(N,L); // one bootstrap sample of size N
˜˜˜˜ ^
cfunctions.cc:99:34: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< map<edge,double> > supp(K); // bootstrap edge support
˜˜˜˜ ^
cfunctions.cc:106:46: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< list<double> > bcond_prob_distr(L); // empirical distribution of cond_prob as estimated by the bootstrap (edges are indexed by the index of the target node)
˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜ ^
cfunctions.cc:110:19: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix bresp(K,N);
˜˜˜˜˜ ^
cfunctions.cc:110:21: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix bresp(K,N);
˜˜˜˜˜ ^
cfunctions.cc:112:42: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
double bN_k = oneN * bresp.row(k);
˜˜˜˜˜ ^
cfunctions.cc:119:12: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
bresp(k,i) /= bN_k;
˜˜˜˜˜ ^
cfunctions.cc:119:14: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
bresp(k,i) /= bN_k;
˜˜˜˜˜ ^
cfunctions.cc:123:96: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
mtreemix_fit0(profile, bpat, balpha, bG, bnode_no, bevent, bcond_prob, bresp.row(k), uniform_noise, special_weighing);
˜˜˜˜˜ ^
cfunctions.cc:126:87: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
mtreemix_fit1(profile, bpat, balpha, bG, bnode_no, bevent, bcond_prob, bresp.row(k), eps, special_weighing);
˜˜˜˜˜ ^
cfunctions.cc:131:37: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
if ((e = edge_between(node_no[k][j1], node_no[k][j2])) != NULL) //nil) // edge in k-th tree of model
˜˜˜˜˜˜˜ ^
cfunctions.cc:131:53: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
if ((e = edge_between(node_no[k][j1], node_no[k][j2])) != NULL) //nil) // edge in k-th tree of model
˜˜˜˜˜˜˜ ^
cfunctions.cc:135:12: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
supp[k][e] += 1.0; // absolute counts
˜˜˜˜ ^
cfunctions.cc:138:24: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
bcond_prob_distr[j2].append(bcond_prob[0][be]);
˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜ ^˜
cfunctions.cc:144:19: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
alpha_lower[k] = ci[0];
˜˜˜˜˜˜˜˜˜˜˜ ^
cfunctions.cc:145:19: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
alpha_upper[k] = ci[1];
˜˜˜˜˜˜˜˜˜˜˜ ^
cfunctions.cc:147:25: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_edges(e, G[k])
˜ ^
./include/Graph.hh:17:52: note: expanded from macro 'forall_edges'
#define forall_edges(e,G) for(uint jcount = 0; e = G.getEdge(jcount), jcount < G.number_of_edges();++jcount)
^
cfunctions.cc:147:25: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_edges(e, G[k])
˜ ^
./include/Graph.hh:17:80: note: expanded from macro 'forall_edges'
#define forall_edges(e,G) for(uint jcount = 0; e = G.getEdge(jcount), jcount < G.number_of_edges();++jcount)
^
cfunctions.cc:149:38: warning: implicit conversion changes signedness: 'mapped_type' (aka 'int') to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
list<double> D = bcond_prob_distr[no_of_node[k][target(e)]]; // distrinution of p(e) in G[k]
˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
cfunctions.cc:149:49: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
list<double> D = bcond_prob_distr[no_of_node[k][target(e)]]; // distrinution of p(e) in G[k]
˜˜˜˜˜˜˜˜˜˜ ^
cfunctions.cc:151:10: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
lower[k][e] = ci[0];
˜˜˜˜˜ ^
cfunctions.cc:152:10: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
upper[k][e] = ci[1];
˜˜˜˜˜ ^
cfunctions.cc:167:22: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_vector pat(L);
˜˜˜ ^
cfunctions.cc:170:37: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< map<node,int> > no_of_node(K);
˜˜˜˜˜˜˜˜˜˜ ^
cfunctions.cc:173:18: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
no_of_node[k][node_no[k][j]] = j;
˜˜˜˜˜˜˜˜˜˜ ^
cfunctions.cc:173:29: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
no_of_node[k][node_no[k][j]] = j;
˜˜˜˜˜˜˜ ^
cfunctions.cc:183:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
stime[i] = expcdf(sampling_param);
˜˜˜˜˜ ^
cfunctions.cc:185:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
stime[i] = sampling_param;
˜˜˜˜˜ ^
cfunctions.cc:188:13: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wtime[i] = mtree_wait(G[k], node_no[k][0], cond_prob[k], lambda[k], no_of_node[k], stime[i], pat);
˜˜˜˜˜ ^
cfunctions.cc:188:31: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
wtime[i] = mtree_wait(G[k], node_no[k][0], cond_prob[k], lambda[k], no_of_node[k], stime[i], pat);
˜ ^
cfunctions.cc:188:43: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
wtime[i] = mtree_wait(G[k], node_no[k][0], cond_prob[k], lambda[k], no_of_node[k], stime[i], pat);
˜˜˜˜˜˜˜ ^
cfunctions.cc:188:60: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
wtime[i] = mtree_wait(G[k], node_no[k][0], cond_prob[k], lambda[k], no_of_node[k], stime[i], pat);
˜˜˜˜˜˜˜˜˜ ^
cfunctions.cc:188:71: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
wtime[i] = mtree_wait(G[k], node_no[k][0], cond_prob[k], lambda[k], no_of_node[k], stime[i], pat);
˜˜˜˜˜˜ ^
cfunctions.cc:188:86: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
wtime[i] = mtree_wait(G[k], node_no[k][0], cond_prob[k], lambda[k], no_of_node[k], stime[i], pat);
˜˜˜˜˜˜˜˜˜˜ ^
cfunctions.cc:188:96: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wtime[i] = mtree_wait(G[k], node_no[k][0], cond_prob[k], lambda[k], no_of_node[k], stime[i], pat);
˜˜˜˜˜ ^
cfunctions.cc:191:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pattern(i,j) = pat[j];
˜˜˜˜˜˜˜ ^
cfunctions.cc:191:12: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pattern(i,j) = pat[j];
˜˜˜˜˜˜˜ ^
cfunctions.cc:191:21: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pattern(i,j) = pat[j];
˜˜˜ ^
cfunctions.cc:204:31: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< list<double> > wtime(N); // lists of waiting times for all patterns
˜˜˜˜˜ ^
cfunctions.cc:222:45: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< map<edge,double> > cond_prob_prime(K);
˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜ ^
cfunctions.cc:229:20: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_edges(e, G[k])
˜ ^
./include/Graph.hh:17:52: note: expanded from macro 'forall_edges'
#define forall_edges(e,G) for(uint jcount = 0; e = G.getEdge(jcount), jcount < G.number_of_edges();++jcount)
^
cfunctions.cc:229:20: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_edges(e, G[k])
˜ ^
./include/Graph.hh:17:80: note: expanded from macro 'forall_edges'
#define forall_edges(e,G) for(uint jcount = 0; e = G.getEdge(jcount), jcount < G.number_of_edges();++jcount)
^
cfunctions.cc:230:20: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cond_prob_prime[k][e] = 1.0 - pow(1.0 - cond_prob[k][e], output_param / sampling_param);
˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜ ^
cfunctions.cc:230:54: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cond_prob_prime[k][e] = 1.0 - pow(1.0 - cond_prob[k][e], output_param / sampling_param);
˜˜˜˜˜˜˜˜˜ ^
cfunctions.cc:236:20: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_edges(e, G[k])
˜ ^
./include/Graph.hh:17:52: note: expanded from macro 'forall_edges'
#define forall_edges(e,G) for(uint jcount = 0; e = G.getEdge(jcount), jcount < G.number_of_edges();++jcount)
^
cfunctions.cc:236:20: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_edges(e, G[k])
˜ ^
./include/Graph.hh:17:80: note: expanded from macro 'forall_edges'
#define forall_edges(e,G) for(uint jcount = 0; e = G.getEdge(jcount), jcount < G.number_of_edges();++jcount)
^
cfunctions.cc:237:20: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cond_prob_prime[k][e] = 1.0 / (1.0 + ((1.0 / cond_prob[k][e]) - 1.0) * (output_param / sampling_param));
˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜ ^
cfunctions.cc:237:59: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cond_prob_prime[k][e] = 1.0 / (1.0 + ((1.0 / cond_prob[k][e]) - 1.0) * (output_param / sampling_param));
˜˜˜˜˜˜˜˜˜ ^
In file included from cfunctions.cc:10:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:53:78: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
T get_item(int pos) {if ((uint)pos < backpoint::size())return backpoint::at(pos); return T(0);}
˜˜˜˜˜˜˜˜˜ ^˜˜
./include/Graph.hh:79:39: note: in instantiation of member function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Node> >::get_item' requested here
node getNode(uint n){ return mynodes.get_item(n);}
^
In file included from cfunctions.cc:10:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:53:78: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
T get_item(int pos) {if ((uint)pos < backpoint::size())return backpoint::at(pos); return T(0);}
˜˜˜˜˜˜˜˜˜ ^˜˜
./include/Graph.hh:167:39: note: in instantiation of member function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Edge> >::get_item' requested here
edge getEdge(uint e){ return myedges.get_item(e);}
^
In file included from cfunctions.cc:10:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:147:21: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim1(){ return N; }
˜˜˜˜˜˜ ^
cfunctions.cc:19:19: note: in instantiation of member function 'replaceleda::mmatrix<int>::dim1' requested here
int N = pattern.dim1(); // sample size
^
In file included from cfunctions.cc:10:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:148:21: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim2(){ return M; }
˜˜˜˜˜˜ ^
cfunctions.cc:20:19: note: in instantiation of member function 'replaceleda::mmatrix<int>::dim2' requested here
int L = pattern.dim2(); // pattern length
^
In file included from cfunctions.cc:10:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:147:21: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim1(){ return N; }
˜˜˜˜˜˜ ^
cfunctions.cc:21:16: note: in instantiation of member function 'replaceleda::mmatrix<double>::dim1' requested here
int K = resp.dim1();
^
In file included from cfunctions.cc:10:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Matrix.hh:44:13: note: in instantiation of member function 'replaceleda::mvector<int>::push_back' requested here
dummy.push_back(D[c++]);
^
cfunctions.cc:25:18: note: in instantiation of member function 'replaceleda::mmatrix<int>::mmatrix' requested here
integer_matrix R(S,L);
^
In file included from cfunctions.cc:10:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Matrix.hh:45:6: note: in instantiation of member function 'replaceleda::mvector<replaceleda::mvector<int> >::push_back' requested here
mx.push_back(dummy);
^
cfunctions.cc:25:18: note: in instantiation of member function 'replaceleda::mmatrix<int>::mmatrix' requested here
integer_matrix R(S,L);
^
In file included from cfunctions.cc:10:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:33:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
D = v2.dim();
˜ ^˜˜˜˜˜˜˜
cfunctions.cc:32:9: note: in instantiation of member function 'replaceleda::mvector<int>::operator=' requested here
x = pattern.row(ri);
^
In file included from cfunctions.cc:10:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:110:20: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim(){ return D;}
˜˜˜˜˜˜ ^
./include/Vector.hh:33:13: note: in instantiation of member function 'replaceleda::mvector<int>::dim' requested here
D = v2.dim();
^
cfunctions.cc:32:9: note: in instantiation of member function 'replaceleda::mvector<int>::operator=' requested here
x = pattern.row(ri);
^
In file included from cfunctions.cc:10:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:83:23: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
result.push_back(mx[i][j]);
˜˜ ^
cfunctions.cc:37:20: note: in instantiation of member function 'replaceleda::mmatrix<double>::col' requested here
gamma = resp.col(ri);
^
In file included from cfunctions.cc:10:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Matrix.hh:83:10: note: in instantiation of member function 'replaceleda::mvector<double>::push_back' requested here
result.push_back(mx[i][j]);
^
cfunctions.cc:37:20: note: in instantiation of member function 'replaceleda::mmatrix<double>::col' requested here
gamma = resp.col(ri);
^
In file included from cfunctions.cc:10:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:33:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
D = v2.dim();
˜ ^˜˜˜˜˜˜˜
cfunctions.cc:37:13: note: in instantiation of member function 'replaceleda::mvector<double>::operator=' requested here
gamma = resp.col(ri);
^
In file included from cfunctions.cc:10:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:46:25: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint length() { return backpoint::size(); }
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
cfunctions.cc:54:15: note: in instantiation of member function 'replaceleda::list<double>::length' requested here
int len = L.length();
^
In file included from cfunctions.cc:10:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Matrix.hh:45:6: note: in instantiation of member function 'replaceleda::mvector<replaceleda::mvector<double> >::push_back' requested here
mx.push_back(dummy);
^
cfunctions.cc:110:13: note: in instantiation of member function 'replaceleda::mmatrix<double>::mmatrix' requested here
matrix bresp(K,N);
^
In file included from cfunctions.cc:10:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:90:18: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
mx.push_back(m[j]);
˜ ^
cfunctions.cc:111:9: note: in instantiation of member function 'replaceleda::mmatrix<int>::operator=' requested here
bpat = resample(pattern, resp, N, bresp);
^
In file included from cfunctions.cc:10:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:91:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
N=m.dim1();
˜^˜˜˜˜˜˜˜
./include/Matrix.hh:92:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
M=m.dim2();
˜^˜˜˜˜˜˜˜
In file included from cfunctions.cc:10:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:110:20: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim(){ return D;}
˜˜˜˜˜˜ ^
cfunctions.cc:165:17: note: in instantiation of member function 'replaceleda::mvector<double>::dim' requested here
int K = alpha.dim();
^
In file included from cfunctions.cc:10:
In file included from ./include/mtreemix.h:14:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:6:
./include/Array.hh:18:25: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'int' [-Wshorten-64-to-32]
int size() { return backpoint::size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
cfunctions.cc:219:21: note: in instantiation of member function 'replaceleda::array<replaceleda::map<replaceleda::RefCountPtr<replaceleda::Edge>, double> >::size' requested here
int K = cond_prob.size();
^
94 warnings generated.
clang++ -I/Library/Frameworks/R.framework/Resources/include -DNDEBUG -I/usr/local/include -fPIC -mtune=native -g -O2 -Wall -pedantic -Wconversion -c kmeans.cc -o kmeans.o
In file included from kmeans.cc:11:
In file included from ./include/kmeans.h:20:
In file included from ./include/replaceleda.hh:7:
./include/Graph.hh:79:48: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
node getNode(uint n){ return mynodes.get_item(n);}
˜˜˜˜˜˜˜ ^
./include/Graph.hh:81:30: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint outdeg(node n){ return n->out_edges().size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:84:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
return n->in_edges().size();
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:88:30: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint degree(node n){ return n->adj_edges().size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:167:48: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
edge getEdge(uint e){ return myedges.get_item(e);}
˜˜˜˜˜˜˜ ^
./include/Graph.hh:180:33: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint number_of_nodes() {return mynodes.size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:181:33: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint number_of_edges() {return myedges.size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:207:57: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
for(uint kcount = 0; ce = (*cn)->out_edges().get_item(kcount), kcount < (*cn)->out_edges().size(); ++kcount)
˜ ^˜˜˜˜˜
kmeans.cc:22:23: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
if ((d = (x - M[k]).sqr_length()) < dist_min)
˜ ^
kmeans.cc:37:19: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array<vector> M(K); // cluster means
˜ ^
kmeans.cc:44:24: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector x = X.row(sigma[i]);
˜ ^˜˜˜˜˜˜˜
kmeans.cc:44:30: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
vector x = X.row(sigma[i]);
˜˜˜˜˜ ^
kmeans.cc:47:13: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
if ((x - M[l]).sqr_length() < min_diff)
˜ ^
kmeans.cc:53:5: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
M[k++] = x;
˜ ˜^˜
kmeans.cc:74:24: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_vector C_new(N); // cluster assignments
˜˜˜˜˜ ^
kmeans.cc:82:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
C_new[i] = argmin(X.row(i), M);
˜˜˜˜˜ ^
kmeans.cc:82:26: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
C_new[i] = argmin(X.row(i), M);
˜ ^
kmeans.cc:86:19: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix sum (K,L);
˜˜˜ ^
kmeans.cc:86:21: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix sum (K,L);
˜˜˜ ^
kmeans.cc:87:28: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_vector count(K);
˜˜˜˜˜ ^
kmeans.cc:91:20: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
int c = C_new[i]; //.to_long();
˜˜˜˜˜ ^
kmeans.cc:92:16: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
count[c]++;
˜˜˜˜˜ ^
kmeans.cc:93:18: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
sum.row(c) += X.row(i);
˜˜˜ ^
kmeans.cc:93:30: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
sum.row(c) += X.row(i);
˜ ^
kmeans.cc:97:6: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
M[k] = sum.row(k) * ( 1 / (double) count[k]); //.to_double());
˜ ^
kmeans.cc:97:19: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
M[k] = sum.row(k) * ( 1 / (double) count[k]); //.to_double());
˜˜˜ ^
kmeans.cc:97:45: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
M[k] = sum.row(k) * ( 1 / (double) count[k]); //.to_double());
˜˜˜˜˜ ^
kmeans.cc:125:12: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
int c = C[i]; //.to_long();
˜ ^
kmeans.cc:126:19: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
W += (X.row(i)-M[c]).sqr_length();
˜ ^
kmeans.cc:126:24: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
W += (X.row(i)-M[c]).sqr_length();
˜ ^
kmeans.cc:145:20: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_vector C(N); // cluster assignments
˜ ^
kmeans.cc:146:19: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array<vector> M(K); // cluster means
˜ ^
In file included from kmeans.cc:11:
In file included from ./include/kmeans.h:20:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:53:78: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
T get_item(int pos) {if ((uint)pos < backpoint::size())return backpoint::at(pos); return T(0);}
˜˜˜˜˜˜˜˜˜ ^˜˜
./include/Graph.hh:79:39: note: in instantiation of member function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Node> >::get_item' requested here
node getNode(uint n){ return mynodes.get_item(n);}
^
In file included from kmeans.cc:11:
In file included from ./include/kmeans.h:20:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:53:78: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
T get_item(int pos) {if ((uint)pos < backpoint::size())return backpoint::at(pos); return T(0);}
˜˜˜˜˜˜˜˜˜ ^˜˜
./include/Graph.hh:167:39: note: in instantiation of member function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Edge> >::get_item' requested here
edge getEdge(uint e){ return myedges.get_item(e);}
^
In file included from kmeans.cc:11:
In file included from ./include/kmeans.h:20:
In file included from ./include/replaceleda.hh:6:
./include/Array.hh:18:25: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'int' [-Wshorten-64-to-32]
int size() { return backpoint::size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
kmeans.cc:20:21: note: in instantiation of member function 'replaceleda::array<replaceleda::mvector<double> >::size' requested here
for (int k=0; k<M.size(); k++)
^
In file included from kmeans.cc:11:
In file included from ./include/kmeans.h:20:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Vector.hh:59:10: note: in instantiation of member function 'replaceleda::mvector<double>::push_back' requested here
result.push_back(v[i]-v2[i]);
^
kmeans.cc:22:19: note: in instantiation of member function 'replaceleda::mvector<double>::operator-' requested here
if ((d = (x - M[k]).sqr_length()) < dist_min)
^
In file included from kmeans.cc:11:
In file included from ./include/kmeans.h:20:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:147:21: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim1(){ return N; }
˜˜˜˜˜˜ ^
kmeans.cc:36:13: note: in instantiation of member function 'replaceleda::mmatrix<double>::dim1' requested here
int N = X.dim1();
^
In file included from kmeans.cc:11:
In file included from ./include/kmeans.h:20:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:33:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
D = v2.dim();
˜ ^˜˜˜˜˜˜˜
kmeans.cc:53:9: note: in instantiation of member function 'replaceleda::mvector<double>::operator=' requested here
M[k++] = x;
^
In file included from kmeans.cc:11:
In file included from ./include/kmeans.h:20:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:110:20: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim(){ return D;}
˜˜˜˜˜˜ ^
./include/Vector.hh:33:13: note: in instantiation of member function 'replaceleda::mvector<double>::dim' requested here
D = v2.dim();
^
kmeans.cc:53:9: note: in instantiation of member function 'replaceleda::mvector<double>::operator=' requested here
M[k++] = x;
^
In file included from kmeans.cc:11:
In file included from ./include/kmeans.h:20:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:148:21: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim2(){ return M; }
˜˜˜˜˜˜ ^
kmeans.cc:72:13: note: in instantiation of member function 'replaceleda::mmatrix<double>::dim2' requested here
int L = X.dim2();
^
In file included from kmeans.cc:11:
In file included from ./include/kmeans.h:20:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:33:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
D = v2.dim();
˜ ^˜˜˜˜˜˜˜
kmeans.cc:78:9: note: in instantiation of member function 'replaceleda::mvector<int>::operator=' requested here
C = C_new;
^
In file included from kmeans.cc:11:
In file included from ./include/kmeans.h:20:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:110:20: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim(){ return D;}
˜˜˜˜˜˜ ^
./include/Vector.hh:33:13: note: in instantiation of member function 'replaceleda::mvector<int>::dim' requested here
D = v2.dim();
^
kmeans.cc:78:9: note: in instantiation of member function 'replaceleda::mvector<int>::operator=' requested here
C = C_new;
^
In file included from kmeans.cc:11:
In file included from ./include/kmeans.h:20:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Matrix.hh:45:6: note: in instantiation of member function 'replaceleda::mvector<replaceleda::mvector<double> >::push_back' requested here
mx.push_back(dummy);
^
kmeans.cc:86:14: note: in instantiation of member function 'replaceleda::mmatrix<double>::mmatrix' requested here
matrix sum (K,L);
^
43 warnings generated.
clang++ -I/Library/Frameworks/R.framework/Resources/include -DNDEBUG -I/usr/local/include -fPIC -mtune=native -g -O2 -Wall -pedantic -Wconversion -c max_weight_branch.cc -o max_weight_branch.o
In file included from max_weight_branch.cc:11:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
./include/Graph.hh:79:48: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
node getNode(uint n){ return mynodes.get_item(n);}
˜˜˜˜˜˜˜ ^
./include/Graph.hh:81:30: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint outdeg(node n){ return n->out_edges().size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:84:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
return n->in_edges().size();
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:88:30: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint degree(node n){ return n->adj_edges().size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:167:48: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
edge getEdge(uint e){ return myedges.get_item(e);}
˜˜˜˜˜˜˜ ^
./include/Graph.hh:180:33: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint number_of_nodes() {return mynodes.size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:181:33: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint number_of_edges() {return myedges.size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:207:57: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
for(uint kcount = 0; ce = (*cn)->out_edges().get_item(kcount), kcount < (*cn)->out_edges().size(); ++kcount)
˜ ^˜˜˜˜˜
max_weight_branch.cc:51:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, B)
^˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
max_weight_branch.cc:67:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, B)
^˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
max_weight_branch.cc:97:3: warning: expression result unused [-Wunused-value]
forall_nodes(v, G)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
max_weight_branch.cc:126:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, B)
^˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
max_weight_branch.cc:142:3: warning: expression result unused [-Wunused-value]
forall_nodes(v, G) // choose heaviest inedge
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
max_weight_branch.cc:166:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, B)
^˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
max_weight_branch.cc:192:7: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(first_e, CEL)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
max_weight_branch.cc:208:21: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
k++; CA.resize(k+1);
˜˜ ˜^˜
max_weight_branch.cc:209:8: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
CA[k] = C;
˜˜ ^
max_weight_branch.cc:223:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, C)
^˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
max_weight_branch.cc:291:21: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
list<edge> C = CA[k]; // cycle to be contracted (indexed by k)
˜˜ ^
max_weight_branch.cc:295:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, C)
^˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
max_weight_branch.cc:302:25: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cheapest_edge.resize(i+1); cheapest_edge[i].resize(k+1);
˜˜˜˜˜˜˜˜˜˜˜˜˜ ˜^˜
max_weight_branch.cc:302:45: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cheapest_edge.resize(i+1); cheapest_edge[i].resize(k+1);
˜˜˜˜˜˜˜˜˜˜˜˜˜ ^
max_weight_branch.cc:302:56: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cheapest_edge.resize(i+1); cheapest_edge[i].resize(k+1);
˜˜˜˜˜˜˜˜˜˜˜˜˜ ˜^˜
max_weight_branch.cc:303:17: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cheapest_edge[i][k] = C.contents(C.min(*compare_weights));
˜˜˜˜˜˜˜˜˜˜˜˜˜ ^
max_weight_branch.cc:303:20: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cheapest_edge[i][k] = C.contents(C.min(*compare_weights));
˜˜˜˜˜˜˜˜˜˜˜˜˜ ^
max_weight_branch.cc:307:23: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cycle_contr.resize(i+1); cycle_contr[i].resize(k+1);
˜˜˜˜˜˜˜˜˜˜˜ ˜^˜
max_weight_branch.cc:307:41: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cycle_contr.resize(i+1); cycle_contr[i].resize(k+1);
˜˜˜˜˜˜˜˜˜˜˜ ^
max_weight_branch.cc:307:52: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cycle_contr.resize(i+1); cycle_contr[i].resize(k+1);
˜˜˜˜˜˜˜˜˜˜˜ ˜^˜
max_weight_branch.cc:308:15: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cycle_contr[i][k] = v_C; // in G[i+1]
˜˜˜˜˜˜˜˜˜˜˜ ^
max_weight_branch.cc:308:18: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cycle_contr[i][k] = v_C; // in G[i+1]
˜˜˜˜˜˜˜˜˜˜˜ ^
max_weight_branch.cc:312:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, EL)
^˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
max_weight_branch.cc:314:21: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
alpha.resize(i+1); alpha[i].resize(k+1);
˜˜˜˜˜ ˜^˜
max_weight_branch.cc:314:33: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
alpha.resize(i+1); alpha[i].resize(k+1);
˜˜˜˜˜ ^
max_weight_branch.cc:314:44: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
alpha.resize(i+1); alpha[i].resize(k+1);
˜˜˜˜˜ ˜^˜
max_weight_branch.cc:315:13: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
alpha[i][k][H[e]] = predecessor_in_cycle(target(H[e]), C); // predecessor edge of target(e) in C
˜˜˜˜˜ ^
max_weight_branch.cc:315:16: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
alpha[i][k][H[e]] = predecessor_in_cycle(target(H[e]), C); // predecessor edge of target(e) in C
˜˜˜˜˜ ^
max_weight_branch.cc:316:38: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
contract_cycle_edge(e, c[alpha[i][k][H[e]]], c[cheapest_edge[i][k]], H, v_C, edge_contr, VC);
˜˜˜˜˜ ^
max_weight_branch.cc:316:41: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
contract_cycle_edge(e, c[alpha[i][k][H[e]]], c[cheapest_edge[i][k]], H, v_C, edge_contr, VC);
˜˜˜˜˜ ^
max_weight_branch.cc:316:68: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
contract_cycle_edge(e, c[alpha[i][k][H[e]]], c[cheapest_edge[i][k]], H, v_C, edge_contr, VC);
˜˜˜˜˜˜˜˜˜˜˜˜˜ ^
max_weight_branch.cc:316:71: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
contract_cycle_edge(e, c[alpha[i][k][H[e]]], c[cheapest_edge[i][k]], H, v_C, edge_contr, VC);
˜˜˜˜˜˜˜˜˜˜˜˜˜ ^
max_weight_branch.cc:322:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(v, NL)
^˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
max_weight_branch.cc:341:3: warning: expression result unused [-Wunused-value]
forall_nodes(v, G)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
max_weight_branch.cc:376:29: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
CCS.insert(cycle_contr[i-1][k]);
˜˜˜˜˜˜˜˜˜˜˜ ˜^˜
max_weight_branch.cc:376:33: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
CCS.insert(cycle_contr[i-1][k]);
˜˜˜˜˜˜˜˜˜˜˜ ^
max_weight_branch.cc:379:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, B_H)
^˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
max_weight_branch.cc:386:25: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
list<edge> C = CA[k]; // cycle edges
˜˜ ^
max_weight_branch.cc:390:7: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, B_H)
^˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
max_weight_branch.cc:391:34: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
if (H.target(e) == cycle_contr[i-1][k])
˜˜˜˜˜˜˜˜˜˜˜ ˜^˜
max_weight_branch.cc:391:38: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
if (H.target(e) == cycle_contr[i-1][k])
˜˜˜˜˜˜˜˜˜˜˜ ^
max_weight_branch.cc:397:4: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, C)
^˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
max_weight_branch.cc:398:22: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
if (e != alpha[i-1][k][Phi[e_prime]])
˜˜˜˜˜ ˜^˜
max_weight_branch.cc:398:26: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
if (e != alpha[i-1][k][Phi[e_prime]])
˜˜˜˜˜ ^
max_weight_branch.cc:403:4: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, C)
^˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
max_weight_branch.cc:404:30: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
if (e != cheapest_edge[i-1][k])
˜˜˜˜˜˜˜˜˜˜˜˜˜ ˜^˜
max_weight_branch.cc:404:34: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
if (e != cheapest_edge[i-1][k])
˜˜˜˜˜˜˜˜˜˜˜˜˜ ^
max_weight_branch.cc:432:3: warning: expression result unused [-Wunused-value]
forall_nodes(v, G[0]) // node labels
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
max_weight_branch.cc:442:14: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
while (CAA[i].size() > 0)
˜˜˜ ^
max_weight_branch.cc:445:17: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
G.resize(i+2); B.resize(i+2); CAA.resize(i+2);
˜ ˜^˜
max_weight_branch.cc:445:33: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
G.resize(i+2); B.resize(i+2); CAA.resize(i+2);
˜ ˜^˜
max_weight_branch.cc:445:51: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
G.resize(i+2); B.resize(i+2); CAA.resize(i+2);
˜˜˜ ˜^˜
max_weight_branch.cc:447:29: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
contract_all_cycles(G[i], i, CAA[i], G[i+1]);
˜ ^
max_weight_branch.cc:447:40: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
contract_all_cycles(G[i], i, CAA[i], G[i+1]);
˜˜˜ ^
max_weight_branch.cc:447:47: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
contract_all_cycles(G[i], i, CAA[i], G[i+1]);
˜ ˜^˜
max_weight_branch.cc:450:9: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
B[i] = max_weight_subgraph_indeg_le_1(G[i]); // (step 2)
˜ ^
max_weight_branch.cc:450:47: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
B[i] = max_weight_subgraph_indeg_le_1(G[i]); // (step 2)
˜ ^
max_weight_branch.cc:452:11: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
CAA[i] = all_cycles(G[i], B[i]); // (step 3)
˜˜˜ ^
max_weight_branch.cc:452:29: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
CAA[i] = all_cycles(G[i], B[i]); // (step 3)
˜ ^
max_weight_branch.cc:452:35: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
CAA[i] = all_cycles(G[i], B[i]); // (step 3)
˜ ^
max_weight_branch.cc:458:34: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
reconstruct_branching(i, G[i], B[i], B[i-1], CAA[i-1]);
˜ ^
max_weight_branch.cc:458:40: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
reconstruct_branching(i, G[i], B[i], B[i-1], CAA[i-1]);
˜ ^
max_weight_branch.cc:458:47: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
reconstruct_branching(i, G[i], B[i], B[i-1], CAA[i-1]);
˜ ˜^˜
max_weight_branch.cc:458:57: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
reconstruct_branching(i, G[i], B[i], B[i-1], CAA[i-1]);
˜˜˜ ˜^˜
max_weight_branch.cc:463:15: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall(e, B[i]){
˜ ^
./include/Graph.hh:21:46: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^
max_weight_branch.cc:463:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, B[i]){
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
max_weight_branch.cc:463:15: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall(e, B[i]){
˜ ^
./include/Graph.hh:21:75: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^
max_weight_branch.cc:464:17: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
B0.append(G[i][e]);
˜ ^
In file included from max_weight_branch.cc:11:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:53:78: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
T get_item(int pos) {if ((uint)pos < backpoint::size())return backpoint::at(pos); return T(0);}
˜˜˜˜˜˜˜˜˜ ^˜˜
./include/Graph.hh:79:39: note: in instantiation of member function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Node> >::get_item' requested here
node getNode(uint n){ return mynodes.get_item(n);}
^
In file included from max_weight_branch.cc:11:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:53:78: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
T get_item(int pos) {if ((uint)pos < backpoint::size())return backpoint::at(pos); return T(0);}
˜˜˜˜˜˜˜˜˜ ^˜˜
./include/Graph.hh:167:39: note: in instantiation of member function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Edge> >::get_item' requested here
edge getEdge(uint e){ return myedges.get_item(e);}
^
In file included from max_weight_branch.cc:11:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:6:
./include/Array.hh:18:25: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'int' [-Wshorten-64-to-32]
int size() { return backpoint::size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
max_weight_branch.cc:442:17: note: in instantiation of member function 'replaceleda::array<replaceleda::list<replaceleda::RefCountPtr<replaceleda::Edge> > >::size' requested here
while (CAA[i].size() > 0)
^
79 warnings generated.
clang++ -I/Library/Frameworks/R.framework/Resources/include -DNDEBUG -I/usr/local/include -fPIC -mtune=native -g -O2 -Wall -pedantic -Wconversion -c mtree.cc -o mtree.o
In file included from mtree.cc:12:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
./include/Graph.hh:79:48: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
node getNode(uint n){ return mynodes.get_item(n);}
˜˜˜˜˜˜˜ ^
./include/Graph.hh:81:30: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint outdeg(node n){ return n->out_edges().size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:84:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
return n->in_edges().size();
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:88:30: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint degree(node n){ return n->adj_edges().size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:167:48: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
edge getEdge(uint e){ return myedges.get_item(e);}
˜˜˜˜˜˜˜ ^
./include/Graph.hh:180:33: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint number_of_nodes() {return mynodes.size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:181:33: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint number_of_edges() {return myedges.size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:207:57: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
for(uint kcount = 0; ce = (*cn)->out_edges().get_item(kcount), kcount < (*cn)->out_edges().size(); ++kcount)
˜ ^˜˜˜˜˜
mtree.cc:35:24: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
profile.resize(j+1);
˜˜˜˜˜˜˜ ˜^˜
mtree.cc:36:17: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
profile[j++] = s;
˜˜˜˜˜˜˜ ˜^˜
mtree.cc:50:22: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
profile.resize(L);
˜˜˜˜˜˜˜ ^
mtree.cc:52:10: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
profile[j] = tostring("%d", j);
˜˜˜˜˜˜˜ ^
mtree.cc:75:21: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
prf << profile[j] << std::endl;
˜˜˜˜˜˜˜ ^
mtree.cc:129:12: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix P(L, L); // Note: P(0,:), P(:,0) and the diagonal
˜ ^
mtree.cc:129:15: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix P(L, L); // Note: P(0,:), P(:,0) and the diagonal
˜ ^
mtree.cc:140:13: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if ((pat(i,j1) >= 0) && (pat(i,j2) >= 0)) // ie. both non-missing
˜˜˜ ^
mtree.cc:140:15: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if ((pat(i,j1) >= 0) && (pat(i,j2) >= 0)) // ie. both non-missing
˜˜˜ ^˜
mtree.cc:140:33: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if ((pat(i,j1) >= 0) && (pat(i,j2) >= 0)) // ie. both non-missing
˜˜˜ ^
mtree.cc:140:35: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if ((pat(i,j1) >= 0) && (pat(i,j2) >= 0)) // ie. both non-missing
˜˜˜ ^˜
mtree.cc:144:23: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wcount += resp[i] * (double)(pat(i,j1) * pat(i,j2));
˜˜˜˜ ^
mtree.cc:144:41: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wcount += resp[i] * (double)(pat(i,j1) * pat(i,j2));
˜˜˜ ^
mtree.cc:144:43: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wcount += resp[i] * (double)(pat(i,j1) * pat(i,j2));
˜˜˜ ^˜
mtree.cc:144:53: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wcount += resp[i] * (double)(pat(i,j1) * pat(i,j2));
˜˜˜ ^
mtree.cc:144:55: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wcount += resp[i] * (double)(pat(i,j1) * pat(i,j2));
˜˜˜ ^˜
mtree.cc:145:25: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
resp_sum += resp[i];
˜˜˜˜ ^
mtree.cc:151:19: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wcount = P(0,j1) * P(0,j2); // assuming independence
˜ ^˜
mtree.cc:151:29: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wcount = P(0,j1) * P(0,j2); // assuming independence
˜ ^˜
mtree.cc:154:4: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
P(j1,j2) = P(j2,j1) = (wcount / resp_sum) + PSEUDO_COUNT;
˜ ^˜
mtree.cc:154:7: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
P(j1,j2) = P(j2,j1) = (wcount / resp_sum) + PSEUDO_COUNT;
˜ ^˜
mtree.cc:154:15: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
P(j1,j2) = P(j2,j1) = (wcount / resp_sum) + PSEUDO_COUNT;
˜ ^˜
mtree.cc:154:18: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
P(j1,j2) = P(j2,j1) = (wcount / resp_sum) + PSEUDO_COUNT;
˜ ^˜
mtree.cc:177:26: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
event[v] = profile[i];
˜˜˜˜˜˜˜ ^
mtree.cc:181:3: warning: expression result unused [-Wunused-value]
forall_nodes(v, G)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
mtree.cc:182:5: warning: expression result unused [-Wunused-value]
forall_nodes(w, G)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
mtree.cc:207:21: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
prob_cond[e] = P(j,i) / P(i,i); // == P(j|i)
˜ ^
mtree.cc:207:23: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
prob_cond[e] = P(j,i) / P(i,i); // == P(j|i)
˜ ^
mtree.cc:207:30: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
prob_cond[e] = P(j,i) / P(i,i); // == P(j|i)
˜ ^
mtree.cc:207:32: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
prob_cond[e] = P(j,i) / P(i,i); // == P(j|i)
˜ ^
mtree.cc:214:16: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
w[e] = log(P(j,j));
˜ ^
mtree.cc:214:18: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
w[e] = log(P(j,j));
˜ ^
mtree.cc:216:16: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
w[e] = log(P(i,j)) - log(P(i,i) + P(j,j)) - log(P(j,j));
˜ ^
mtree.cc:216:18: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
w[e] = log(P(i,j)) - log(P(i,i) + P(j,j)) - log(P(j,j));
˜ ^
mtree.cc:216:30: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
w[e] = log(P(i,j)) - log(P(i,i) + P(j,j)) - log(P(j,j));
˜ ^
mtree.cc:216:32: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
w[e] = log(P(i,j)) - log(P(i,i) + P(j,j)) - log(P(j,j));
˜ ^
mtree.cc:216:39: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
w[e] = log(P(i,j)) - log(P(i,i) + P(j,j)) - log(P(j,j));
˜ ^
mtree.cc:216:41: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
w[e] = log(P(i,j)) - log(P(i,i) + P(j,j)) - log(P(j,j));
˜ ^
mtree.cc:216:53: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
w[e] = log(P(i,j)) - log(P(i,i) + P(j,j)) - log(P(j,j));
˜ ^
mtree.cc:216:55: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
w[e] = log(P(i,j)) - log(P(i,i) + P(j,j)) - log(P(j,j));
˜ ^
mtree.cc:249:35: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
like *= (pattern[k] == 1) ? P(k,k) : (1 - P(k,k));
˜ ^
mtree.cc:249:37: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
like *= (pattern[k] == 1) ? P(k,k) : (1 - P(k,k));
˜ ^
mtree.cc:249:49: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
like *= (pattern[k] == 1) ? P(k,k) : (1 - P(k,k));
˜ ^
mtree.cc:249:51: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
like *= (pattern[k] == 1) ? P(k,k) : (1 - P(k,k));
˜ ^
mtree.cc:268:3: warning: expression result unused [-Wunused-value]
forall_nodes(w, G)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
mtree.cc:278:7: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e, v)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
mtree.cc:312:17: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if (pattern[j] > 0)
˜˜˜˜˜˜˜ ^
mtree.cc:317:3: warning: expression result unused [-Wunused-value]
forall_nodes(w, G)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
mtree.cc:334:7: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e, v)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
mtree.cc:359:20: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array<int> sigma(n);
˜˜˜˜˜ ^
mtree.cc:362:11: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
sigma[k] = k;
˜˜˜˜˜ ^
mtree.cc:377:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e, root)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
mtree.cc:405:13: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
cP += P[++k];
˜ ^˜˜
mtree.cc:430:22: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_vector pat(L);
˜˜˜ ^
mtree.cc:440:3: warning: expression result unused [-Wunused-value]
forall_nodes(w, G)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
mtree.cc:451:7: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e, v)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
mtree.cc:460:9: warning: implicit conversion changes signedness: 'mapped_type' (aka 'int') to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[no_of_node[w]] = 1;
˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜
mtree.cc:477:11: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int L = G.number_of_nodes();
˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
mtree.cc:482:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_defined(e, lambda)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:20:84: note: expanded from macro 'forall_defined'
#define forall_defined(el,map) for(uint kcount = 0; el = map.getDefined().get_item(kcount), kcount < map.getDefined().size(); ++kcount)
^˜˜˜˜˜
mtree.cc:485:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_defined(e, cond_prob)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:20:84: note: expanded from macro 'forall_defined'
#define forall_defined(el,map) for(uint kcount = 0; el = map.getDefined().get_item(kcount), kcount < map.getDefined().size(); ++kcount)
^˜˜˜˜˜
mtree.cc:494:14: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
cpattern[j] = 0;
˜˜˜˜˜˜˜˜ ^
mtree.cc:500:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e, root)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
mtree.cc:512:7: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e, target(cedge)) // insert child edges of cedge
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
mtree.cc:515:22: warning: implicit conversion changes signedness: 'mapped_type' (aka 'int') to 'uint' (aka 'unsigned int') [-Wsign-conversion]
cpattern[no_of_node[target(e)]] = 1; // update cpattern
˜˜˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
mtree.cc:518:13: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e1, target(e)) {
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
mtree.cc:531:13: warning: implicit conversion changes signedness: 'mapped_type' (aka 'int') to 'uint' (aka 'unsigned int') [-Wsign-conversion]
cpattern[no_of_node[target(cedge)]] = 1; // update cpattern
˜˜˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
mtree.cc:545:11: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int L = G.number_of_nodes();
˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
mtree.cc:550:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_defined(e, lambda)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:20:84: note: expanded from macro 'forall_defined'
#define forall_defined(el,map) for(uint kcount = 0; el = map.getDefined().get_item(kcount), kcount < map.getDefined().size(); ++kcount)
^˜˜˜˜˜
mtree.cc:553:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_defined(e, cond_prob)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:20:84: note: expanded from macro 'forall_defined'
#define forall_defined(el,map) for(uint kcount = 0; el = map.getDefined().get_item(kcount), kcount < map.getDefined().size(); ++kcount)
^˜˜˜˜˜
mtree.cc:559:27: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_vector cpattern(L); // current pattern
˜˜˜˜˜˜˜˜ ^
mtree.cc:562:9: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
wtime[pattern2index(cpattern)].append(ctime); // record initial null pattern
˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
mtree.cc:566:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e, root)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
mtree.cc:576:7: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e, target(cedge)) // insert child edges of cedge
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
mtree.cc:579:22: warning: implicit conversion changes signedness: 'mapped_type' (aka 'int') to 'uint' (aka 'unsigned int') [-Wsign-conversion]
cpattern[no_of_node[target(e)]] = 1; // update cpattern
˜˜˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
mtree.cc:582:13: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e1, target(e)) {
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
mtree.cc:592:16: warning: implicit conversion changes signedness: 'mapped_type' (aka 'int') to 'uint' (aka 'unsigned int') [-Wsign-conversion]
cpattern[no_of_node[target(cedge)]] = 1; // update cpattern
˜˜˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
mtree.cc:594:13: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
wtime[pattern2index(cpattern)].append(ctime); // record waiting time
˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
mtree.cc:623:14: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector one(N);
˜˜˜ ^
mtree.cc:626:9: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
one[i] = 1.0;
˜˜˜ ^
mtree.cc:641:19: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
index += (pat[j] == 1) * pow2(j-1);
˜˜˜ ^
mtree.cc:652:22: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_vector pat(L);
˜˜˜ ^
mtree.cc:658:11: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[j] = integer(mod2);
˜˜˜ ^
mtree.cc:676:19: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
index += (pat[j] == 1) * pow2(j-1);
˜˜˜ ^
mtree.cc:688:22: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_vector pat(L);
˜˜˜ ^
mtree.cc:693:11: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[j] = integer(mod2);
˜˜˜ ^
mtree.cc:711:13: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if (X[i] >= 0.0)
˜ ^
mtree.cc:714:12: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
is_nonneg[i] = 0.0;
˜˜˜˜˜˜˜˜˜ ^
mtree.cc:729:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(x, L)
^˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
mtree.cc:746:13: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector XX(X.dim()); // double X
˜˜ ^˜˜˜˜˜˜
mtree.cc:752:13: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if (X[i] >= 0)
˜ ^
mtree.cc:754:9: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
XX[i] = (double) X[i];
˜˜ ^
mtree.cc:754:25: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
XX[i] = (double) X[i];
˜ ^
mtree.cc:758:12: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
is_nonneg[i] = 0.0;
˜˜˜˜˜˜˜˜˜ ^
mtree.cc:780:3: warning: expression result unused [-Wunused-value]
forall_nodes(w, G)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
mtree.cc:791:7: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e, v)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
mtree.cc:830:6: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
s[i] = rand() % L; //random draw integer from 0 to L-1
˜ ^
mtree.cc:831:17: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
deg[(uint) s[i]]++; // increase the degree of that node
˜ ^
mtree.cc:837:16: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
deg[(uint)s[i]]++; // increase the degree of that node
˜ ^
mtree.cc:850:24: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
event[v] = profile[i];
˜˜˜˜˜˜˜ ^
mtree.cc:855:13: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if(deg[i]==1)
˜˜˜ ^
mtree.cc:867:22: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if (--deg[(uint)s[i]]==1) // decrease the degree
˜ ^
mtree.cc:868:17: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
Q.insert((uint)s[i],node_no[(uint)s[i]]);
˜ ^˜˜˜˜˜˜˜˜˜
mtree.cc:868:25: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
Q.insert((uint)s[i],node_no[(uint)s[i]]);
˜ ^
mtree.cc:868:36: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'const key_type' (aka 'const int') [-Wsign-conversion]
Q.insert((uint)s[i],node_no[(uint)s[i]]);
˜˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜
mtree.cc:868:44: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
Q.insert((uint)s[i],node_no[(uint)s[i]]);
˜ ^
mtree.cc:871:23: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'const key_type' (aka 'const int') [-Wsign-conversion]
G.new_edge(node_no[(uint)s[i]],v);
˜˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜
mtree.cc:871:31: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
G.new_edge(node_no[(uint)s[i]],v);
˜ ^
mtree.cc:872:26: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'const key_type' (aka 'const int') [-Wsign-conversion]
G.new_edge(v, node_no[(uint)s[i]]);
˜˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜
mtree.cc:872:34: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
G.new_edge(v, node_no[(uint)s[i]]);
˜ ^
mtree.cc:905:38: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
sum_row = sum_row + (double)abs(m(i,j));
˜ ^
mtree.cc:905:40: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
sum_row = sum_row + (double)abs(m(i,j));
˜ ^
mtree.cc:922:23: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix adj1(L,L), adj2(L,L); // the adjacency matrix
˜˜˜˜ ^
mtree.cc:922:25: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix adj1(L,L), adj2(L,L); // the adjacency matrix
˜˜˜˜ ^
mtree.cc:922:34: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix adj1(L,L), adj2(L,L); // the adjacency matrix
˜˜˜˜ ^
mtree.cc:922:36: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix adj1(L,L), adj2(L,L); // the adjacency matrix
˜˜˜˜ ^
mtree.cc:934:12: warning: implicit conversion changes signedness: 'mapped_type' (aka 'int') to 'uint' (aka 'unsigned int') [-Wsign-conversion]
{ adj1(no_of_node1[source(e)],no_of_node1[target(e)]) = 1; }
˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
mtree.cc:934:35: warning: implicit conversion changes signedness: 'mapped_type' (aka 'int') to 'uint' (aka 'unsigned int') [-Wsign-conversion]
{ adj1(no_of_node1[source(e)],no_of_node1[target(e)]) = 1; }
˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
mtree.cc:937:12: warning: implicit conversion changes signedness: 'mapped_type' (aka 'int') to 'uint' (aka 'unsigned int') [-Wsign-conversion]
{ adj2(no_of_node2[source(e)],no_of_node2[target(e)]) = 1; }
˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
mtree.cc:937:35: warning: implicit conversion changes signedness: 'mapped_type' (aka 'int') to 'uint' (aka 'unsigned int') [-Wsign-conversion]
{ adj2(no_of_node2[source(e)],no_of_node2[target(e)]) = 1; }
˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
In file included from mtree.cc:12:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:53:78: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
T get_item(int pos) {if ((uint)pos < backpoint::size())return backpoint::at(pos); return T(0);}
˜˜˜˜˜˜˜˜˜ ^˜˜
./include/Graph.hh:79:39: note: in instantiation of member function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Node> >::get_item' requested here
node getNode(uint n){ return mynodes.get_item(n);}
^
In file included from mtree.cc:12:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:53:78: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
T get_item(int pos) {if ((uint)pos < backpoint::size())return backpoint::at(pos); return T(0);}
˜˜˜˜˜˜˜˜˜ ^˜˜
./include/Graph.hh:167:39: note: in instantiation of member function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Edge> >::get_item' requested here
edge getEdge(uint e){ return myedges.get_item(e);}
^
In file included from mtree.cc:12:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:6:
./include/Array.hh:18:25: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'int' [-Wshorten-64-to-32]
int size() { return backpoint::size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
mtree.cc:63:19: note: in instantiation of member function 'replaceleda::array<std::basic_string<char> >::size' requested here
int L = profile.size();
^
In file included from mtree.cc:12:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:33:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
D = v2.dim();
˜ ^˜˜˜˜˜˜˜
/usr/include/c++/4.2.1/bits/stl_algobase.h:433:18: note: in instantiation of member function 'replaceleda::mvector<int>::operator=' requested here
*--__result = *--__last;
^
/usr/include/c++/4.2.1/bits/stl_algobase.h:463:14: note: in instantiation of function template specialization 'std::__copy_backward<false, std::random_access_iterator_tag>::__copy_b<replaceleda::mvector<int> *, replaceleda::mvector<int> *>' requested here
return std::__copy_backward<__simple, _Category>::__copy_b(__first,
^
/usr/include/c++/4.2.1/bits/stl_algobase.h:474:18: note: in instantiation of function template specialization 'std::__copy_backward_aux<replaceleda::mvector<int> *, replaceleda::mvector<int> *>' requested here
{ return std::__copy_backward_aux(__first, __last, __result); }
^
/usr/include/c++/4.2.1/bits/stl_algobase.h:538:14: note: in instantiation of function template specialization 'std::__copy_backward_normal<false, false>::__copy_b_n<replaceleda::mvector<int> *, replaceleda::mvector<int> *>' requested here
return std::__copy_backward_normal<__bi1, __bi2>::__copy_b_n(__first,
^
/usr/include/c++/4.2.1/bits/vector.tcc:324:5: note: in instantiation of function template specialization 'std::copy_backward<replaceleda::mvector<int> *, replaceleda::mvector<int> *>' requested here
std::copy_backward(__position.base(), __old_finish - __n,
^
/usr/include/c++/4.2.1/bits/stl_vector.h:656:9: note: in instantiation of member function 'std::vector<replaceleda::mvector<int>, std::allocator<replaceleda::mvector<int> > >::_M_fill_insert' requested here
{ _M_fill_insert(__position, __n, __x); }
^
/usr/include/c++/4.2.1/bits/stl_vector.h:424:4: note: in instantiation of member function 'std::vector<replaceleda::mvector<int>, std::allocator<replaceleda::mvector<int> > >::insert' requested here
insert(end(), __new_size - size(), __x);
^
./include/Vector.hh:13:22: note: in instantiation of member function 'std::vector<replaceleda::mvector<int>, std::allocator<replaceleda::mvector<int> > >::resize' requested here
mvector(): D(0) { v.resize(0);}
^
./include/Matrix.hh:15:2: note: in instantiation of member function 'replaceleda::mvector<replaceleda::mvector<int> >::mvector' requested here
mmatrix() : N(0), M(0){};
^
mtree.cc:85:18: note: in instantiation of member function 'replaceleda::mmatrix<int>::mmatrix' requested here
integer_matrix pattern;
^
In file included from mtree.cc:12:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:147:21: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim1(){ return N; }
˜˜˜˜˜˜ ^
mtree.cc:126:15: note: in instantiation of member function 'replaceleda::mmatrix<int>::dim1' requested here
int N = pat.dim1(); // sample size
^
In file included from mtree.cc:12:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:148:21: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim2(){ return M; }
˜˜˜˜˜˜ ^
mtree.cc:127:15: note: in instantiation of member function 'replaceleda::mmatrix<int>::dim2' requested here
int L = pat.dim2(); // pattern length
^
In file included from mtree.cc:12:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:33:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
D = v2.dim();
˜ ^˜˜˜˜˜˜˜
/usr/include/c++/4.2.1/bits/stl_algobase.h:433:18: note: in instantiation of member function 'replaceleda::mvector<double>::operator=' requested here
*--__result = *--__last;
^
/usr/include/c++/4.2.1/bits/stl_algobase.h:463:14: note: in instantiation of function template specialization 'std::__copy_backward<false, std::random_access_iterator_tag>::__copy_b<replaceleda::mvector<double> *, replaceleda::mvector<double> *>' requested here
return std::__copy_backward<__simple, _Category>::__copy_b(__first,
^
/usr/include/c++/4.2.1/bits/stl_algobase.h:474:18: note: in instantiation of function template specialization 'std::__copy_backward_aux<replaceleda::mvector<double> *, replaceleda::mvector<double> *>' requested here
{ return std::__copy_backward_aux(__first, __last, __result); }
^
/usr/include/c++/4.2.1/bits/stl_algobase.h:538:14: note: in instantiation of function template specialization 'std::__copy_backward_normal<false, false>::__copy_b_n<replaceleda::mvector<double> *, replaceleda::mvector<double> *>' requested here
return std::__copy_backward_normal<__bi1, __bi2>::__copy_b_n(__first,
^
/usr/include/c++/4.2.1/bits/vector.tcc:324:5: note: in instantiation of function template specialization 'std::copy_backward<replaceleda::mvector<double> *, replaceleda::mvector<double> *>' requested here
std::copy_backward(__position.base(), __old_finish - __n,
^
/usr/include/c++/4.2.1/bits/stl_vector.h:656:9: note: in instantiation of member function 'std::vector<replaceleda::mvector<double>, std::allocator<replaceleda::mvector<double> > >::_M_fill_insert' requested here
{ _M_fill_insert(__position, __n, __x); }
^
/usr/include/c++/4.2.1/bits/stl_vector.h:424:4: note: in instantiation of member function 'std::vector<replaceleda::mvector<double>, std::allocator<replaceleda::mvector<double> > >::insert' requested here
insert(end(), __new_size - size(), __x);
^
./include/Vector.hh:13:22: note: in instantiation of member function 'std::vector<replaceleda::mvector<double>, std::allocator<replaceleda::mvector<double> > >::resize' requested here
mvector(): D(0) { v.resize(0);}
^
./include/Matrix.hh:38:2: note: in instantiation of member function 'replaceleda::mvector<replaceleda::mvector<double> >::mvector' requested here
mmatrix(uint n, uint m) : N(n), M(m) {
^
mtree.cc:129:10: note: in instantiation of member function 'replaceleda::mmatrix<double>::mmatrix' requested here
matrix P(L, L); // Note: P(0,:), P(:,0) and the diagonal
^
In file included from mtree.cc:12:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Matrix.hh:44:13: note: in instantiation of member function 'replaceleda::mvector<double>::push_back' requested here
dummy.push_back(D[c++]);
^
mtree.cc:129:10: note: in instantiation of member function 'replaceleda::mmatrix<double>::mmatrix' requested here
matrix P(L, L); // Note: P(0,:), P(:,0) and the diagonal
^
In file included from mtree.cc:12:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Matrix.hh:45:6: note: in instantiation of member function 'replaceleda::mvector<replaceleda::mvector<double> >::push_back' requested here
mx.push_back(dummy);
^
mtree.cc:129:10: note: in instantiation of member function 'replaceleda::mmatrix<double>::mmatrix' requested here
matrix P(L, L); // Note: P(0,:), P(:,0) and the diagonal
^
In file included from mtree.cc:12:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:110:20: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim(){ return D;}
˜˜˜˜˜˜ ^
mtree.cc:303:19: note: in instantiation of member function 'replaceleda::mvector<int>::dim' requested here
int L = pattern.dim(); // pattern length
^
In file included from mtree.cc:12:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:8:
In file included from ./include/Edge.hh:6:
./include/Set.hh:19:20: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'int' [-Wshorten-64-to-32]
int size(){return backpoint::size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
mtree.cc:349:28: note: in instantiation of member function 'replaceleda::set<replaceleda::RefCountPtr<replaceleda::Node> >::size' requested here
if (visited_events < Pat.size()) // ie. pattern does not fit onto branching
^
In file included from mtree.cc:12:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:6:
./include/Array.hh:27:36: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dummy.push_back(backpoint::at(r));
˜˜˜˜˜˜˜˜˜ ^
mtree.cc:363:9: note: in instantiation of member function 'replaceleda::array<int>::permute' requested here
sigma.permute(); // draw a permutation sigma \in S(n)
^
In file included from mtree.cc:12:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:110:20: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim(){ return D;}
˜˜˜˜˜˜ ^
mtree.cc:395:13: note: in instantiation of member function 'replaceleda::mvector<double>::dim' requested here
int K = P.dim();
^
In file included from mtree.cc:12:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:53:78: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
T get_item(int pos) {if ((uint)pos < backpoint::size())return backpoint::at(pos); return T(0);}
˜˜˜˜˜˜˜˜˜ ^˜˜
mtree.cc:729:3: note: in instantiation of member function 'replaceleda::list<double>::get_item' requested here
forall(x, L)
^
./include/Graph.hh:21:48: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^
In file included from mtree.cc:12:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Matrix.hh:44:13: note: in instantiation of member function 'replaceleda::mvector<int>::push_back' requested here
dummy.push_back(D[c++]);
^
mtree.cc:922:18: note: in instantiation of member function 'replaceleda::mmatrix<int>::mmatrix' requested here
integer_matrix adj1(L,L), adj2(L,L); // the adjacency matrix
^
In file included from mtree.cc:12:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Matrix.hh:45:6: note: in instantiation of member function 'replaceleda::mvector<replaceleda::mvector<int> >::push_back' requested here
mx.push_back(dummy);
^
mtree.cc:922:18: note: in instantiation of member function 'replaceleda::mmatrix<int>::mmatrix' requested here
integer_matrix adj1(L,L), adj2(L,L); // the adjacency matrix
^
143 warnings generated.
clang++ -I/Library/Frameworks/R.framework/Resources/include -DNDEBUG -I/usr/local/include -fPIC -mtune=native -g -O2 -Wall -pedantic -Wconversion -c mtreemix.cc -o mtreemix.o
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
./include/Graph.hh:79:48: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
node getNode(uint n){ return mynodes.get_item(n);}
˜˜˜˜˜˜˜ ^
./include/Graph.hh:81:30: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint outdeg(node n){ return n->out_edges().size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:84:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
return n->in_edges().size();
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:88:30: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint degree(node n){ return n->adj_edges().size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:167:48: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
edge getEdge(uint e){ return myedges.get_item(e);}
˜˜˜˜˜˜˜ ^
./include/Graph.hh:180:33: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint number_of_nodes() {return mynodes.size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:181:33: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint number_of_edges() {return myedges.size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:207:57: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
for(uint kcount = 0; ce = (*cn)->out_edges().get_item(kcount), kcount < (*cn)->out_edges().size(); ++kcount)
˜ ^˜˜˜˜˜
mtreemix.cc:19:15: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector freq(L);
˜˜˜˜ ^
mtreemix.cc:23:36: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_vector col = pat.col(j);
˜˜˜ ^
mtreemix.cc:24:12: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
freq[j] = nonnegmean(col); // == rel. frequency
˜˜˜˜ ^
mtreemix.cc:25:16: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if (freq[j] < 0.0) // no data in this column!
˜˜˜˜ ^
mtreemix.cc:44:16: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if (freq[j] < 0.0) // no data in this column!
˜˜˜˜ ^
mtreemix.cc:46:14: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = (myrand() > 0.5) ? 1 : 0; // random choice
˜˜˜˜˜˜˜ ^
mtreemix.cc:46:16: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = (myrand() > 0.5) ? 1 : 0; // random choice
˜˜˜˜˜˜˜ ^
mtreemix.cc:49:12: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if (pat(i,j) < 0)
˜˜˜ ^
mtreemix.cc:49:14: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if (pat(i,j) < 0)
˜˜˜ ^
mtreemix.cc:50:14: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = integer(freq[j] + 0.5); // substitute most common value
˜˜˜˜˜˜˜ ^
mtreemix.cc:50:16: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = integer(freq[j] + 0.5); // substitute most common value
˜˜˜˜˜˜˜ ^
mtreemix.cc:50:34: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = integer(freq[j] + 0.5); // substitute most common value
˜˜˜˜ ^
mtreemix.cc:52:14: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = pat(i,j);
˜˜˜˜˜˜˜ ^
mtreemix.cc:52:16: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = pat(i,j);
˜˜˜˜˜˜˜ ^
mtreemix.cc:52:25: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = pat(i,j);
˜˜˜ ^
mtreemix.cc:52:27: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = pat(i,j);
˜˜˜ ^
mtreemix.cc:69:9: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
resp(k,i) = 1.0;
˜˜˜˜ ^
mtreemix.cc:69:11: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
resp(k,i) = 1.0;
˜˜˜˜ ^
mtreemix.cc:75:14: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix X(N,L);
˜ ^
mtreemix.cc:75:16: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix X(N,L);
˜ ^
mtreemix.cc:78:6: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
X(i,j) = (pattern(i,j) < 0) ? 0.5 : (double) pattern(i,j); // 0.5 if missing
˜ ^
mtreemix.cc:78:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
X(i,j) = (pattern(i,j) < 0) ? 0.5 : (double) pattern(i,j); // 0.5 if missing
˜ ^
mtreemix.cc:78:22: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
X(i,j) = (pattern(i,j) < 0) ? 0.5 : (double) pattern(i,j); // 0.5 if missing
˜˜˜˜˜˜˜ ^
mtreemix.cc:78:24: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
X(i,j) = (pattern(i,j) < 0) ? 0.5 : (double) pattern(i,j); // 0.5 if missing
˜˜˜˜˜˜˜ ^
mtreemix.cc:78:57: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
X(i,j) = (pattern(i,j) < 0) ? 0.5 : (double) pattern(i,j); // 0.5 if missing
˜˜˜˜˜˜˜ ^
mtreemix.cc:78:59: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
X(i,j) = (pattern(i,j) < 0) ? 0.5 : (double) pattern(i,j); // 0.5 if missing
˜˜˜˜˜˜˜ ^
mtreemix.cc:80:22: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_vector C(N); // cluster assignments
˜ ^
mtreemix.cc:83:4: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
C[i] = 0; // no cluster
˜ ^
mtreemix.cc:86:20: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array<vector> M(K - 1); // cluster means
˜ ˜˜^˜˜
mtreemix.cc:93:14: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
resp(0,i) = 0.01;
˜˜˜˜ ^
mtreemix.cc:97:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
resp(k,i) = 0.99 / (dK + 3.0);
˜˜˜˜ ^
mtreemix.cc:97:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
resp(k,i) = 0.99 / (dK + 3.0);
˜˜˜˜ ^
mtreemix.cc:101:9: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if (C[i] + 1 == k)
˜ ^
mtreemix.cc:102:9: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
resp(k,i) = (3.0 * 0.99) / (3.0 + dK);
˜˜˜˜ ^
mtreemix.cc:102:11: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
resp(k,i) = (3.0 * 0.99) / (3.0 + dK);
˜˜˜˜ ^
mtreemix.cc:139:42: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
dotout << "\t\tlabel=\"" << alpha[k] << "\";" << std::endl;
˜˜˜˜˜ ^
mtreemix.cc:144:24: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
list<edge> E = G[k].all_edges();
˜ ^
mtreemix.cc:147:19: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
v = node_no[k][0];
˜˜˜˜˜˜˜ ^
mtreemix.cc:148:57: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dotout << "\t\t \"" << v << "\" [label=\"" << mut[k][v] << "\"];" << std::endl;
˜˜˜ ^
mtreemix.cc:149:7: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, E)
^˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
mtreemix.cc:152:54: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dotout << "\t\t \"" << v << "\" [label=\"" << mut[k][v] << "\"];" << std::endl;
˜˜˜ ^
mtreemix.cc:157:7: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, E)
^˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
mtreemix.cc:165:46: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dotout << " [label=\"" << edge_weight[k][e] << "\"];" << std::endl;
˜˜˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:168:52: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dotout << " [label=\"" << int(1/edge_weight[k][e]) << "\"];" << std::endl; // in days
˜˜˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:170:53: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dotout << " [label=\"" << int((1/edge_weight[k][e])/7.0) << "\"];" << std::endl;
˜˜˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:172:50: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dotout << " [label=\"" << int(edge_weight[k][e]) << "\"];" << std::endl;
˜˜˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:212:42: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dotout << "\t\tlabel=\"" << tree_label[k] << "\";" << std::endl;
˜˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:217:20: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
list<edge> E = G[k].all_edges();
˜ ^
mtreemix.cc:220:15: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
v = node_no[k][0];
˜˜˜˜˜˜˜ ^
mtreemix.cc:221:53: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dotout << "\t\t \"" << v << "\" [label=\"" << mut[k][v] << "\"];" << std::endl;
˜˜˜ ^
mtreemix.cc:222:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, E)
^˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
mtreemix.cc:225:57: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dotout << "\t\t \"" << v << "\" [label=\"" << mut[k][v] << "\"];" << std::endl;
˜˜˜ ^
mtreemix.cc:237:46: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dotout << " [label=\"" << edge_label[k][e] << "\"];";
˜˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:248:46: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dotout << "\t\tlabel=\"" << tree_label[k] << "\";" << std::endl;
˜˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:253:24: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
list<edge> E = G[k].all_edges();
˜ ^
mtreemix.cc:256:19: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
v = node_no[k][0];
˜˜˜˜˜˜˜ ^
mtreemix.cc:257:57: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dotout << "\t\t \"" << v << "\" [label=\"" << mut[k][v] << "\"];" << std::endl;
˜˜˜ ^
mtreemix.cc:258:7: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, E)
^˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
mtreemix.cc:261:54: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dotout << "\t\t \"" << v << "\" [label=\"" << mut[k][v] << "\"];" << std::endl;
˜˜˜ ^
mtreemix.cc:266:7: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, E)
^˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
mtreemix.cc:271:41: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dotout << " [label=\"" << edge_label[k][e] << "\"];" << std::endl;
˜˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:288:13: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if (pat[j] == -1)
˜˜˜ ^
mtreemix.cc:304:34: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< matrix > P(K); // weighted pair probabilities
˜ ^
mtreemix.cc:305:37: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< edge_array<double> > dist(K); // weight functional
˜˜˜˜ ^
mtreemix.cc:306:34: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< list<edge> > B(K); // branching
˜ ^
mtreemix.cc:321:15: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = pattern(i,j); // copy
˜˜˜˜˜˜˜ ^
mtreemix.cc:321:17: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = pattern(i,j); // copy
˜˜˜˜˜˜˜ ^
mtreemix.cc:321:30: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = pattern(i,j); // copy
˜˜˜˜˜˜˜ ^
mtreemix.cc:321:32: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = pattern(i,j); // copy
˜˜˜˜˜˜˜ ^
mtreemix.cc:337:6: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
P[k] = pair_probs(pat_hat, resp.row(k));
˜ ^
mtreemix.cc:337:40: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
P[k] = pair_probs(pat_hat, resp.row(k));
˜˜˜˜ ^
mtreemix.cc:340:27: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
mgraph_init(profile, G[k], event[k], dist[k], node_no[k]);
˜ ^
mtreemix.cc:340:37: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
mgraph_init(profile, G[k], event[k], dist[k], node_no[k]);
˜˜˜˜˜ ^
mtreemix.cc:340:46: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
mgraph_init(profile, G[k], event[k], dist[k], node_no[k]);
˜˜˜˜ ^
mtreemix.cc:340:58: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
mgraph_init(profile, G[k], event[k], dist[k], node_no[k]);
˜˜˜˜˜˜˜ ^
mtreemix.cc:352:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, B[0])
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
mtreemix.cc:355:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, B[0])
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
mtreemix.cc:362:23: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
mgraph_weigh(P[k], profile, G[k], dist[k], cond_prob[k], node_no[k], eps, special_weighing);
˜ ^
mtreemix.cc:362:38: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
mgraph_weigh(P[k], profile, G[k], dist[k], cond_prob[k], node_no[k], eps, special_weighing);
˜ ^
mtreemix.cc:362:47: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
mgraph_weigh(P[k], profile, G[k], dist[k], cond_prob[k], node_no[k], eps, special_weighing);
˜˜˜˜ ^
mtreemix.cc:362:61: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
mgraph_weigh(P[k], profile, G[k], dist[k], cond_prob[k], node_no[k], eps, special_weighing);
˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:362:73: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
mgraph_weigh(P[k], profile, G[k], dist[k], cond_prob[k], node_no[k], eps, special_weighing);
˜˜˜˜˜˜˜ ^
mtreemix.cc:363:10: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
B[k] = MAX_WEIGHT_BRANCHING(G[k], event[k], dist[k]);
˜ ^
mtreemix.cc:363:38: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
B[k] = MAX_WEIGHT_BRANCHING(G[k], event[k], dist[k]);
˜ ^
mtreemix.cc:363:48: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
B[k] = MAX_WEIGHT_BRANCHING(G[k], event[k], dist[k]);
˜˜˜˜˜ ^
mtreemix.cc:363:57: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
B[k] = MAX_WEIGHT_BRANCHING(G[k], event[k], dist[k]);
˜˜˜˜ ^
mtreemix.cc:364:28: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
UNCOVER_BRANCHING(G[k], B[k]);
˜ ^
mtreemix.cc:364:34: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
UNCOVER_BRANCHING(G[k], B[k]);
˜ ^
mtreemix.cc:368:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
alpha[k] = (oneN * resp.row(k)) / N; // == sum(resp(k,:) / N
˜˜˜˜˜ ^
mtreemix.cc:368:32: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
alpha[k] = (oneN * resp.row(k)) / N; // == sum(resp(k,:) / N
˜˜˜˜ ^
mtreemix.cc:378:52: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
list<int> index_m = missing_indices(pattern.row(i));
˜˜˜˜˜˜˜ ^
mtreemix.cc:384:31: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_vector pat_max(L);
˜˜˜˜˜˜˜ ^
mtreemix.cc:392:42: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_vector pat = pattern.row(i);
˜˜˜˜˜˜˜ ^
mtreemix.cc:394:9: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(j, index_m)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
mtreemix.cc:395:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[j] = pat_m[j_m++];
˜˜˜ ^
mtreemix.cc:395:22: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[j] = pat_m[j_m++];
˜˜˜˜˜ ˜˜˜^˜
mtreemix.cc:413:42: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_vector pat = pattern.row(i);
˜˜˜˜˜˜˜ ^
mtreemix.cc:414:9: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(j, index_m)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
mtreemix.cc:415:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[j] = (myrand() < freq[j]) ? 1 : 0;
˜˜˜ ^
mtreemix.cc:415:30: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[j] = (myrand() < freq[j]) ? 1 : 0;
˜˜˜˜ ^
mtreemix.cc:429:6: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(j, index_m) // consider all missing values
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
mtreemix.cc:431:14: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[j] = (pat[j] + 1) % 2; // switch at position j
˜˜˜ ^
mtreemix.cc:431:24: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[j] = (pat[j] + 1) % 2; // switch at position j
˜˜˜ ^
mtreemix.cc:440:9: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[j] = (pat[j] + 1) % 2; // undo j-switch
˜˜˜ ^
mtreemix.cc:440:19: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[j] = (pat[j] + 1) % 2; // undo j-switch
˜˜˜ ^
mtreemix.cc:448:11: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = pat_max[j];
˜˜˜˜˜˜˜ ^
mtreemix.cc:448:13: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = pat_max[j];
˜˜˜˜˜˜˜ ^
mtreemix.cc:448:26: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = pat_max[j];
˜˜˜˜˜˜˜ ^
mtreemix.cc:455:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat_hat.row(i), G[k], node_no[k], cond_prob[k]); // "weighted likelihood"
˜˜˜˜˜ ^
mtreemix.cc:455:12: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat_hat.row(i), G[k], node_no[k], cond_prob[k]); // "weighted likelihood"
˜˜˜˜˜ ^
mtreemix.cc:455:23: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat_hat.row(i), G[k], node_no[k], cond_prob[k]); // "weighted likelihood"
˜˜˜˜˜ ^
mtreemix.cc:455:51: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat_hat.row(i), G[k], node_no[k], cond_prob[k]); // "weighted likelihood"
˜˜˜˜˜˜˜ ^
mtreemix.cc:455:57: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat_hat.row(i), G[k], node_no[k], cond_prob[k]); // "weighted likelihood"
˜ ^
mtreemix.cc:455:69: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat_hat.row(i), G[k], node_no[k], cond_prob[k]); // "weighted likelihood"
˜˜˜˜˜˜˜ ^
mtreemix.cc:455:83: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat_hat.row(i), G[k], node_no[k], cond_prob[k]); // "weighted likelihood"
˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:460:34: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
double sum = oneK * wlike.row(i); // sum of weighted likelihoods
˜˜˜˜˜ ^
mtreemix.cc:464:27: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
<< " [" << pat_hat.row(i) << "] "
˜˜˜˜˜˜˜ ^
mtreemix.cc:471:11: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
resp(k,i) = wlike(i,k) / sum; // responsibility
˜˜˜˜ ^
mtreemix.cc:471:13: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
resp(k,i) = wlike(i,k) / sum; // responsibility
˜˜˜˜ ^
mtreemix.cc:471:24: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
resp(k,i) = wlike(i,k) / sum; // responsibility
˜˜˜˜˜ ^
mtreemix.cc:471:26: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
resp(k,i) = wlike(i,k) / sum; // responsibility
˜˜˜˜˜ ^
mtreemix.cc:379:14: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'int' [-Wshorten-64-to-32]
int L_m = index_m.size(); // number of missing values
˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
mtreemix.cc:501:15: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = pattern(i,j); // copy
˜˜˜˜˜˜˜ ^
mtreemix.cc:501:17: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = pattern(i,j); // copy
˜˜˜˜˜˜˜ ^
mtreemix.cc:501:30: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = pattern(i,j); // copy
˜˜˜˜˜˜˜ ^
mtreemix.cc:501:32: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = pattern(i,j); // copy
˜˜˜˜˜˜˜ ^
mtreemix.cc:507:52: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
list<int> index_m = missing_indices(pattern.row(i));
˜˜˜˜˜˜˜ ^
mtreemix.cc:513:31: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_vector pat_max(L);
˜˜˜˜˜˜˜ ^
mtreemix.cc:521:42: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_vector pat = pattern.row(i);
˜˜˜˜˜˜˜ ^
mtreemix.cc:523:9: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(j, index_m)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
mtreemix.cc:524:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[j] = pat_m[j_m++];
˜˜˜ ^
mtreemix.cc:524:22: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[j] = pat_m[j_m++];
˜˜˜˜˜ ˜˜˜^˜
mtreemix.cc:542:42: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_vector pat = pattern.row(i);
˜˜˜˜˜˜˜ ^
mtreemix.cc:543:9: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(j, index_m)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
mtreemix.cc:544:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[j] = (myrand() < freq[j]) ? 1 : 0;
˜˜˜ ^
mtreemix.cc:544:30: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[j] = (myrand() < freq[j]) ? 1 : 0;
˜˜˜˜ ^
mtreemix.cc:558:6: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(j, index_m) // consider all missing values
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
mtreemix.cc:560:14: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[j] = (pat[j] + 1) % 2; // switch at position j
˜˜˜ ^
mtreemix.cc:560:24: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[j] = (pat[j] + 1) % 2; // switch at position j
˜˜˜ ^
mtreemix.cc:569:9: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[j] = (pat[j] + 1) % 2; // undo j-switch
˜˜˜ ^
mtreemix.cc:569:19: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[j] = (pat[j] + 1) % 2; // undo j-switch
˜˜˜ ^
mtreemix.cc:577:11: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = pat_max[j];
˜˜˜˜˜˜˜ ^
mtreemix.cc:577:13: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = pat_max[j];
˜˜˜˜˜˜˜ ^
mtreemix.cc:577:26: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat_hat(i,j) = pat_max[j];
˜˜˜˜˜˜˜ ^
mtreemix.cc:584:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat_hat.row(i), G[k], node_no[k], cond_prob[k]); // "weighted likelihood"
˜˜˜˜˜ ^
mtreemix.cc:584:12: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat_hat.row(i), G[k], node_no[k], cond_prob[k]); // "weighted likelihood"
˜˜˜˜˜ ^
mtreemix.cc:584:23: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat_hat.row(i), G[k], node_no[k], cond_prob[k]); // "weighted likelihood"
˜˜˜˜˜ ^
mtreemix.cc:584:51: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat_hat.row(i), G[k], node_no[k], cond_prob[k]); // "weighted likelihood"
˜˜˜˜˜˜˜ ^
mtreemix.cc:584:57: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat_hat.row(i), G[k], node_no[k], cond_prob[k]); // "weighted likelihood"
˜ ^
mtreemix.cc:584:69: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat_hat.row(i), G[k], node_no[k], cond_prob[k]); // "weighted likelihood"
˜˜˜˜˜˜˜ ^
mtreemix.cc:584:83: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
wlike(i,k) = alpha[k] * mtree_like(pat_hat.row(i), G[k], node_no[k], cond_prob[k]); // "weighted likelihood"
˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:589:34: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
double sum = oneK * wlike.row(i); // sum of weighted likelihoods
˜˜˜˜˜ ^
mtreemix.cc:593:27: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
<< " [" << pat_hat.row(i) << "] "
˜˜˜˜˜˜˜ ^
mtreemix.cc:600:11: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
resp(k,i) = wlike(i,k) / sum; // responsibility
˜˜˜˜ ^
mtreemix.cc:600:13: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
resp(k,i) = wlike(i,k) / sum; // responsibility
˜˜˜˜ ^
mtreemix.cc:600:24: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
resp(k,i) = wlike(i,k) / sum; // responsibility
˜˜˜˜˜ ^
mtreemix.cc:600:26: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
resp(k,i) = wlike(i,k) / sum; // responsibility
˜˜˜˜˜ ^
mtreemix.cc:508:14: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'int' [-Wshorten-64-to-32]
int L_m = index_m.size(); // number of missing values
˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
mtreemix.cc:616:16: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix wlike(N,K); // "weighted likelihood" of a sample
˜˜˜˜˜ ^
mtreemix.cc:616:18: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix wlike(N,K); // "weighted likelihood" of a sample
˜˜˜˜˜ ^
mtreemix.cc:622:15: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
sum += alpha[k] * mtree_like(pattern.row(i), G[k], node_no[k], cond_prob[k]);
˜˜˜˜˜ ^
mtreemix.cc:622:43: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
sum += alpha[k] * mtree_like(pattern.row(i), G[k], node_no[k], cond_prob[k]);
˜˜˜˜˜˜˜ ^
mtreemix.cc:622:49: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
sum += alpha[k] * mtree_like(pattern.row(i), G[k], node_no[k], cond_prob[k]);
˜ ^
mtreemix.cc:622:61: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
sum += alpha[k] * mtree_like(pattern.row(i), G[k], node_no[k], cond_prob[k]);
˜˜˜˜˜˜˜ ^
mtreemix.cc:622:75: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
sum += alpha[k] * mtree_like(pattern.row(i), G[k], node_no[k], cond_prob[k]);
˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:626:57: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
std::cerr << "Warning: The sample: [" << pattern.row(i) << "] has likelihood zero!" << std::endl;
˜˜˜˜˜˜˜ ^
mtreemix.cc:644:19: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
prob += alpha[k] * mtree_like(pat, G[k], node_no[k], cond_prob[k]);
˜˜˜˜˜ ^
mtreemix.cc:644:42: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
prob += alpha[k] * mtree_like(pat, G[k], node_no[k], cond_prob[k]);
˜ ^
mtreemix.cc:644:54: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
prob += alpha[k] * mtree_like(pat, G[k], node_no[k], cond_prob[k]);
˜˜˜˜˜˜˜ ^
mtreemix.cc:644:68: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
prob += alpha[k] * mtree_like(pat, G[k], node_no[k], cond_prob[k]);
˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:671:7: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, B)
^˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
mtreemix.cc:674:7: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall(e, B)
^˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:21:57: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^˜˜˜˜˜
mtreemix.cc:708:16: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix wlike(N,K); // "weighted likelihood"
˜˜˜˜˜ ^
mtreemix.cc:708:18: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix wlike(N,K); // "weighted likelihood"
˜˜˜˜˜ ^
mtreemix.cc:715:36: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
list<edge> bfs = mtree_bfs(G[k], node_no[k][0]);
˜ ^
mtreemix.cc:715:48: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
list<edge> bfs = mtree_bfs(G[k], node_no[k][0]);
˜˜˜˜˜˜˜ ^
mtreemix.cc:716:27: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
UNCOVER_BRANCHING(G[k], bfs);
˜ ^
mtreemix.cc:727:11: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int L = G[0].number_of_nodes();
˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
mtreemix.cc:729:12: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix E(L,L);
˜ ^
mtreemix.cc:729:14: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix E(L,L);
˜ ^
mtreemix.cc:747:36: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
edge e = edge_between(node_no[k][i1], node_no[k][i2]);
˜˜˜˜˜˜˜ ^
mtreemix.cc:747:52: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
edge e = edge_between(node_no[k][i1], node_no[k][i2]);
˜˜˜˜˜˜˜ ^
mtreemix.cc:748:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
E(i1,i2) = (e == NULL /*nil*/) ? 0.0 : cond_prob[k][e];
˜ ^˜
mtreemix.cc:748:11: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
E(i1,i2) = (e == NULL /*nil*/) ? 0.0 : cond_prob[k][e];
˜ ^˜
mtreemix.cc:748:55: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
E(i1,i2) = (e == NULL /*nil*/) ? 0.0 : cond_prob[k][e];
˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:776:12: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
G.resize(K);
˜ ^
mtreemix.cc:777:16: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
event.resize(K);
˜˜˜˜˜ ^
mtreemix.cc:778:20: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cond_prob.resize(K);
˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:779:18: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
node_no.resize(K);
˜˜˜˜˜˜˜ ^
mtreemix.cc:790:15: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
node_no[k].clear();
˜˜˜˜˜˜˜ ^
mtreemix.cc:791:13: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
event[k].clear();
˜˜˜˜˜ ^
mtreemix.cc:794:15: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
node v = G[k].new_node();
˜ ^
mtreemix.cc:795:12: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
node_no[k][i] = v;
˜˜˜˜˜˜˜ ^
mtreemix.cc:796:10: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
event[k][v] = profile[i];
˜˜˜˜˜ ^
mtreemix.cc:796:26: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
event[k][v] = profile[i];
˜˜˜˜˜˜˜ ^
mtreemix.cc:800:17: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cond_prob[k].clear();
˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:804:12: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if (E(i1,i2) > 0)
˜ ^˜
mtreemix.cc:804:15: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if (E(i1,i2) > 0)
˜ ^˜
mtreemix.cc:806:14: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
edge e = G[k].new_edge(node_no[k][i1], node_no[k][i2]);
˜ ^
mtreemix.cc:806:34: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
edge e = G[k].new_edge(node_no[k][i1], node_no[k][i2]);
˜˜˜˜˜˜˜ ^
mtreemix.cc:806:50: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
edge e = G[k].new_edge(node_no[k][i1], node_no[k][i2]);
˜˜˜˜˜˜˜ ^
mtreemix.cc:807:13: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
cond_prob[k][e] = E(i1,i2);
˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:807:23: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
cond_prob[k][e] = E(i1,i2);
˜ ^˜
mtreemix.cc:807:26: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
cond_prob[k][e] = E(i1,i2);
˜ ^˜
mtreemix.cc:824:37: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< map<node,int> > no_of_node(K);
˜˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:827:18: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
no_of_node[k][node_no[k][j]] = j;
˜˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:827:29: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
no_of_node[k][node_no[k][j]] = j;
˜˜˜˜˜˜˜ ^
mtreemix.cc:829:26: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix pattern(n,L);
˜˜˜˜˜˜˜ ^
mtreemix.cc:829:28: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_matrix pattern(n,L);
˜˜˜˜˜˜˜ ^
mtreemix.cc:830:22: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_vector pat(L);
˜˜˜ ^
mtreemix.cc:841:26: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
pat = mtree_draw(L, G[k], node_no[k][0], cond_prob[k], no_of_node[k]);
˜ ^
mtreemix.cc:841:38: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
pat = mtree_draw(L, G[k], node_no[k][0], cond_prob[k], no_of_node[k]);
˜˜˜˜˜˜˜ ^
mtreemix.cc:841:55: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
pat = mtree_draw(L, G[k], node_no[k][0], cond_prob[k], no_of_node[k]);
˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:841:70: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
pat = mtree_draw(L, G[k], node_no[k][0], cond_prob[k], no_of_node[k]);
˜˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:843:14: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pattern(i,j) = pat[j];
˜˜˜˜˜˜˜ ^
mtreemix.cc:843:16: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pattern(i,j) = pat[j];
˜˜˜˜˜˜˜ ^
mtreemix.cc:843:25: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pattern(i,j) = pat[j];
˜˜˜ ^
mtreemix.cc:859:36: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
array< map<edge,double> > lambda(K);
˜˜˜˜˜˜ ^
mtreemix.cc:868:32: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_defined(e, cond_prob[k]) // lambda = -log(1 - p) / t_0
˜˜˜˜˜˜˜˜˜ ^
./include/Graph.hh:20:58: note: expanded from macro 'forall_defined'
#define forall_defined(el,map) for(uint kcount = 0; el = map.getDefined().get_item(kcount), kcount < map.getDefined().size(); ++kcount)
^
mtreemix.cc:868:4: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_defined(e, cond_prob[k]) // lambda = -log(1 - p) / t_0
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:20:84: note: expanded from macro 'forall_defined'
#define forall_defined(el,map) for(uint kcount = 0; el = map.getDefined().get_item(kcount), kcount < map.getDefined().size(); ++kcount)
^˜˜˜˜˜
mtreemix.cc:868:32: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_defined(e, cond_prob[k]) // lambda = -log(1 - p) / t_0
˜˜˜˜˜˜˜˜˜ ^
./include/Graph.hh:20:102: note: expanded from macro 'forall_defined'
#define forall_defined(el,map) for(uint kcount = 0; el = map.getDefined().get_item(kcount), kcount < map.getDefined().size(); ++kcount)
^
mtreemix.cc:869:13: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
lambda[k][e] = -log(1 - cond_prob[k][e]) / sampling_param;
˜˜˜˜˜˜ ^
mtreemix.cc:869:40: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
lambda[k][e] = -log(1 - cond_prob[k][e]) / sampling_param;
˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:876:32: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_defined(e, cond_prob[k]) {// lambda = (lambda_s * p) / (1 - p)
˜˜˜˜˜˜˜˜˜ ^
./include/Graph.hh:20:58: note: expanded from macro 'forall_defined'
#define forall_defined(el,map) for(uint kcount = 0; el = map.getDefined().get_item(kcount), kcount < map.getDefined().size(); ++kcount)
^
mtreemix.cc:876:4: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_defined(e, cond_prob[k]) {// lambda = (lambda_s * p) / (1 - p)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:20:84: note: expanded from macro 'forall_defined'
#define forall_defined(el,map) for(uint kcount = 0; el = map.getDefined().get_item(kcount), kcount < map.getDefined().size(); ++kcount)
^˜˜˜˜˜
mtreemix.cc:876:32: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
forall_defined(e, cond_prob[k]) {// lambda = (lambda_s * p) / (1 - p)
˜˜˜˜˜˜˜˜˜ ^
./include/Graph.hh:20:102: note: expanded from macro 'forall_defined'
#define forall_defined(el,map) for(uint kcount = 0; el = map.getDefined().get_item(kcount), kcount < map.getDefined().size(); ++kcount)
^
mtreemix.cc:877:13: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
lambda[k][e] = (sampling_param * cond_prob[k][e]) / (1 - cond_prob[k][e]);
˜˜˜˜˜˜ ^
mtreemix.cc:877:49: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
lambda[k][e] = (sampling_param * cond_prob[k][e]) / (1 - cond_prob[k][e]);
˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:877:73: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
lambda[k][e] = (sampling_param * cond_prob[k][e]) / (1 - cond_prob[k][e]);
˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:901:15: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector prob(n); // vector of probabilities of all patterns
˜˜˜˜ ^
mtreemix.cc:906:12: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
prob[i] = mtreemix_prob(pat, K, alpha, G, node_no, cond_prob);
˜˜˜˜ ^
mtreemix.cc:922:15: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if (pat(i,j) == -1)
˜˜˜ ^
mtreemix.cc:922:17: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if (pat(i,j) == -1)
˜˜˜ ^
mtreemix.cc:942:13: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
alpha[i] = (double) rand()/ (double) RAND_MAX;
˜˜˜˜˜ ^
mtreemix.cc:943:19: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
sum +=alpha[i];
˜˜˜˜˜ ^
mtreemix.cc:948:11: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
alpha[i] = alpha[i]/sum;
˜˜˜˜˜ ^
mtreemix.cc:948:22: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
alpha[i] = alpha[i]/sum;
˜˜˜˜˜ ^
mtreemix.cc:963:18: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
profile.resize(L);
˜˜˜˜˜˜˜ ^
mtreemix.cc:965:13: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
profile[j] = tostring("%d", j);
˜˜˜˜˜˜˜ ^
mtreemix.cc:971:13: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
vector s(L-2);
˜ ˜^˜
mtreemix.cc:977:4: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
s[i] = 0;
˜ ^
mtreemix.cc:989:29: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
mtree_random(L, profile, G[k], event[k], node_no[k], cond_prob[k], s, 1, min, max);
˜ ^
mtreemix.cc:989:39: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
mtree_random(L, profile, G[k], event[k], node_no[k], cond_prob[k], s, 1, min, max);
˜˜˜˜˜ ^
mtreemix.cc:989:51: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
mtree_random(L, profile, G[k], event[k], node_no[k], cond_prob[k], s, 1, min, max);
˜˜˜˜˜˜˜ ^
mtreemix.cc:989:65: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
mtree_random(L, profile, G[k], event[k], node_no[k], cond_prob[k], s, 1, min, max);
˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:995:29: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
mtree_random(L, profile, G[k], event[k], node_no[k], cond_prob[k], s, 1, min, max);
˜ ^
mtreemix.cc:995:39: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
mtree_random(L, profile, G[k], event[k], node_no[k], cond_prob[k], s, 1, min, max);
˜˜˜˜˜ ^
mtreemix.cc:995:51: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
mtree_random(L, profile, G[k], event[k], node_no[k], cond_prob[k], s, 1, min, max);
˜˜˜˜˜˜˜ ^
mtreemix.cc:995:65: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
mtree_random(L, profile, G[k], event[k], node_no[k], cond_prob[k], s, 1, min, max);
˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:1026:17: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
if (pattern[j] > 0)
˜˜˜˜˜˜˜ ^
mtreemix.cc:1031:3: warning: expression result unused [-Wunused-value]
forall_nodes(w, G)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
mtreemix.cc:1048:7: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e, v)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
mtreemix.cc:1079:22: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
integer_vector pat(L);
˜˜˜ ^
mtreemix.cc:1088:11: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
pat[j] = integer(mod2);
˜˜˜ ^
mtreemix.cc:1115:15: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix dist(K1,K2);
˜˜˜˜ ^˜
mtreemix.cc:1115:18: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
matrix dist(K1,K2);
˜˜˜˜ ^˜
mtreemix.cc:1119:12: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
dist(k1,k2) = mtree_distance(L, G1[k1], node_no1[k1], G2[k2], node_no2[k2]);
˜˜˜˜ ^˜
mtreemix.cc:1119:15: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
dist(k1,k2) = mtree_distance(L, G1[k1], node_no1[k1], G2[k2], node_no2[k2]);
˜˜˜˜ ^˜
mtreemix.cc:1119:42: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dist(k1,k2) = mtree_distance(L, G1[k1], node_no1[k1], G2[k2], node_no2[k2]);
˜˜ ^˜
mtreemix.cc:1119:56: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dist(k1,k2) = mtree_distance(L, G1[k1], node_no1[k1], G2[k2], node_no2[k2]);
˜˜˜˜˜˜˜˜ ^˜
mtreemix.cc:1119:64: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dist(k1,k2) = mtree_distance(L, G1[k1], node_no1[k1], G2[k2], node_no2[k2]);
˜˜ ^˜
mtreemix.cc:1119:78: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dist(k1,k2) = mtree_distance(L, G1[k1], node_no1[k1], G2[k2], node_no2[k2]);
˜˜˜˜˜˜˜˜ ^˜
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:53:78: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
T get_item(int pos) {if ((uint)pos < backpoint::size())return backpoint::at(pos); return T(0);}
˜˜˜˜˜˜˜˜˜ ^˜˜
./include/Graph.hh:79:39: note: in instantiation of member function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Node> >::get_item' requested here
node getNode(uint n){ return mynodes.get_item(n);}
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:53:78: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
T get_item(int pos) {if ((uint)pos < backpoint::size())return backpoint::at(pos); return T(0);}
˜˜˜˜˜˜˜˜˜ ^˜˜
./include/Graph.hh:167:39: note: in instantiation of member function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Edge> >::get_item' requested here
edge getEdge(uint e){ return myedges.get_item(e);}
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:148:21: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim2(){ return M; }
˜˜˜˜˜˜ ^
mtreemix.cc:18:15: note: in instantiation of member function 'replaceleda::mmatrix<int>::dim2' requested here
int L = pat.dim2(); // pattern length
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:83:23: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
result.push_back(mx[i][j]);
˜˜ ^
mtreemix.cc:23:32: note: in instantiation of member function 'replaceleda::mmatrix<int>::col' requested here
integer_vector col = pat.col(j);
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Matrix.hh:83:10: note: in instantiation of member function 'replaceleda::mvector<int>::push_back' requested here
result.push_back(mx[i][j]);
^
mtreemix.cc:23:32: note: in instantiation of member function 'replaceleda::mmatrix<int>::col' requested here
integer_vector col = pat.col(j);
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:147:21: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim1(){ return N; }
˜˜˜˜˜˜ ^
mtreemix.cc:39:15: note: in instantiation of member function 'replaceleda::mmatrix<int>::dim1' requested here
int N = pat.dim1(); // sample size
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:33:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
D = v2.dim();
˜ ^˜˜˜˜˜˜˜
/usr/include/c++/4.2.1/bits/stl_algobase.h:433:18: note: in instantiation of member function 'replaceleda::mvector<double>::operator=' requested here
*--__result = *--__last;
^
/usr/include/c++/4.2.1/bits/stl_algobase.h:463:14: note: in instantiation of function template specialization 'std::__copy_backward<false, std::random_access_iterator_tag>::__copy_b<replaceleda::mvector<double> *, replaceleda::mvector<double> *>' requested here
return std::__copy_backward<__simple, _Category>::__copy_b(__first,
^
/usr/include/c++/4.2.1/bits/stl_algobase.h:474:18: note: in instantiation of function template specialization 'std::__copy_backward_aux<replaceleda::mvector<double> *, replaceleda::mvector<double> *>' requested here
{ return std::__copy_backward_aux(__first, __last, __result); }
^
/usr/include/c++/4.2.1/bits/stl_algobase.h:538:14: note: in instantiation of function template specialization 'std::__copy_backward_normal<false, false>::__copy_b_n<replaceleda::mvector<double> *, replaceleda::mvector<double> *>' requested here
return std::__copy_backward_normal<__bi1, __bi2>::__copy_b_n(__first,
^
/usr/include/c++/4.2.1/bits/vector.tcc:324:5: note: in instantiation of function template specialization 'std::copy_backward<replaceleda::mvector<double> *, replaceleda::mvector<double> *>' requested here
std::copy_backward(__position.base(), __old_finish - __n,
^
/usr/include/c++/4.2.1/bits/stl_vector.h:656:9: note: in instantiation of member function 'std::vector<replaceleda::mvector<double>, std::allocator<replaceleda::mvector<double> > >::_M_fill_insert' requested here
{ _M_fill_insert(__position, __n, __x); }
^
/usr/include/c++/4.2.1/bits/stl_vector.h:424:4: note: in instantiation of member function 'std::vector<replaceleda::mvector<double>, std::allocator<replaceleda::mvector<double> > >::insert' requested here
insert(end(), __new_size - size(), __x);
^
./include/Vector.hh:13:22: note: in instantiation of member function 'std::vector<replaceleda::mvector<double>, std::allocator<replaceleda::mvector<double> > >::resize' requested here
mvector(): D(0) { v.resize(0);}
^
./include/Matrix.hh:38:2: note: in instantiation of member function 'replaceleda::mvector<replaceleda::mvector<double> >::mvector' requested here
mmatrix(uint n, uint m) : N(n), M(m) {
^
mtreemix.cc:75:12: note: in instantiation of member function 'replaceleda::mmatrix<double>::mmatrix' requested here
matrix X(N,L);
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Matrix.hh:44:13: note: in instantiation of member function 'replaceleda::mvector<double>::push_back' requested here
dummy.push_back(D[c++]);
^
mtreemix.cc:75:12: note: in instantiation of member function 'replaceleda::mmatrix<double>::mmatrix' requested here
matrix X(N,L);
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Matrix.hh:45:6: note: in instantiation of member function 'replaceleda::mvector<replaceleda::mvector<double> >::push_back' requested here
mx.push_back(dummy);
^
mtreemix.cc:75:12: note: in instantiation of member function 'replaceleda::mmatrix<double>::mmatrix' requested here
matrix X(N,L);
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:6:
./include/Array.hh:18:25: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'int' [-Wshorten-64-to-32]
int size() { return backpoint::size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Array.hh:21:26: note: in instantiation of member function 'replaceleda::array<replaceleda::graph>::size' requested here
int high() { return (size() -1) ;}
^
mtreemix.cc:132:28: note: in instantiation of member function 'replaceleda::array<replaceleda::graph>::high' requested here
for (int k=G.low(); k<=G.high(); k++)
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:110:20: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim(){ return D;}
˜˜˜˜˜˜ ^
mtreemix.cc:287:23: note: in instantiation of member function 'replaceleda::mvector<int>::dim' requested here
for (int j=0; j<pat.dim(); j++)
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:90:18: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
mx.push_back(m[j]);
˜ ^
mtreemix.cc:337:9: note: in instantiation of member function 'replaceleda::mmatrix<double>::operator=' requested here
P[k] = pair_probs(pat_hat, resp.row(k));
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:91:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
N=m.dim1();
˜^˜˜˜˜˜˜˜
./include/Matrix.hh:92:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
M=m.dim2();
˜^˜˜˜˜˜˜˜
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:6:
./include/Array.hh:18:25: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'int' [-Wshorten-64-to-32]
int size() { return backpoint::size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
mtreemix.cc:349:19: note: in instantiation of member function 'replaceleda::array<std::basic_string<char> >::size' requested here
int L = profile.size();
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:53:78: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
T get_item(int pos) {if ((uint)pos < backpoint::size())return backpoint::at(pos); return T(0);}
˜˜˜˜˜˜˜˜˜ ^˜˜
mtreemix.cc:394:9: note: in instantiation of member function 'replaceleda::list<int>::get_item' requested here
forall(j, index_m)
^
./include/Graph.hh:21:48: note: expanded from macro 'forall'
#define forall(e,L) for(uint ecount = 0; e = L.get_item(ecount), ecount < L.size(); ++ecount)
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:33:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
D = v2.dim();
˜ ^˜˜˜˜˜˜˜
mtreemix.cc:402:14: note: in instantiation of member function 'replaceleda::mvector<int>::operator=' requested here
pat_max = pat; // remember best one
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:59:33: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
dummy.push_back(backpoint::at(r));
˜˜˜˜˜˜˜˜˜ ^
mtreemix.cc:428:14: note: in instantiation of member function 'replaceleda::list<int>::permute' requested here
index_m.permute(); // in random order,
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:110:20: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim(){ return D;}
˜˜˜˜˜˜ ^
mtreemix.cc:774:17: note: in instantiation of member function 'replaceleda::mvector<double>::dim' requested here
int K = alpha.dim();
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:147:21: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim1(){ return N; }
˜˜˜˜˜˜ ^
mtreemix.cc:787:37: note: in instantiation of member function 'replaceleda::mmatrix<double>::dim1' requested here
profile = load_profile(filestem, E.dim1());
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:148:21: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim2(){ return M; }
˜˜˜˜˜˜ ^
mtreemix.cc:802:22: note: in instantiation of member function 'replaceleda::mmatrix<double>::dim2' requested here
for (int i2=0; i2<E.dim2(); i2++)
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Matrix.hh:45:6: note: in instantiation of member function 'replaceleda::mvector<replaceleda::mvector<int> >::push_back' requested here
mx.push_back(dummy);
^
mtreemix.cc:829:18: note: in instantiation of member function 'replaceleda::mmatrix<int>::mmatrix' requested here
integer_matrix pattern(n,L);
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:6:
./include/Array.hh:18:25: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'int' [-Wshorten-64-to-32]
int size() { return backpoint::size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
mtreemix.cc:858:21: note: in instantiation of member function 'replaceleda::array<replaceleda::map<replaceleda::RefCountPtr<replaceleda::Edge>, double> >::size' requested here
int K = cond_prob.size();
^
In file included from mtreemix.cc:11:
In file included from ./include/mtree.h:14:
In file included from ./include/max_weight_branch.h:25:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:8:
In file included from ./include/Edge.hh:6:
./include/Set.hh:19:20: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'int' [-Wshorten-64-to-32]
int size(){return backpoint::size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
mtreemix.cc:1067:28: note: in instantiation of member function 'replaceleda::set<replaceleda::RefCountPtr<replaceleda::Node> >::size' requested here
if (visited_events < Pat.size()) // ie. pattern does not fit onto branching
^
294 warnings generated.
clang++ -I/Library/Frameworks/R.framework/Resources/include -DNDEBUG -I/usr/local/include -fPIC -mtune=native -g -O2 -Wall -pedantic -Wconversion -c replaceleda.cc -o replaceleda.o
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:7:
./include/Graph.hh:79:48: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
node getNode(uint n){ return mynodes.get_item(n);}
˜˜˜˜˜˜˜ ^
./include/Graph.hh:81:30: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint outdeg(node n){ return n->out_edges().size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:84:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
return n->in_edges().size();
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:88:30: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint degree(node n){ return n->adj_edges().size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:167:48: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
edge getEdge(uint e){ return myedges.get_item(e);}
˜˜˜˜˜˜˜ ^
./include/Graph.hh:180:33: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint number_of_nodes() {return mynodes.size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:181:33: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
uint number_of_edges() {return myedges.size();}
˜˜˜˜˜˜ ^˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:207:57: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
for(uint kcount = 0; ce = (*cn)->out_edges().get_item(kcount), kcount < (*cn)->out_edges().size(); ++kcount)
˜ ^˜˜˜˜˜
replaceleda.cc:25:25: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
result.push_back(dummy[r]);
˜˜˜˜˜ ^
replaceleda.cc:78:5: warning: expression result unused [-Wunused-value]
forall_nodes(v,G)
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
replaceleda.cc:103:3: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e,v){
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
replaceleda.cc:125:5: warning: expression result unused [-Wunused-value]
forall_nodes(v, g_source){
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
replaceleda.cc:136:2: warning: extra ';' outside of a function is a C++11 extension [-Wc++11-extra-semi]
};
^
replaceleda.cc:146:5: warning: expression result unused [-Wunused-value]
forall_nodes(v, g_source){
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
replaceleda.cc:159:2: warning: extra ';' outside of a function is a C++11 extension [-Wc++11-extra-semi]
};
^
replaceleda.cc:216:14: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
os << m[i][j] << " ";
˜ ^
replaceleda.cc:216:17: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
os << m[i][j] << " ";
˜ ^
replaceleda.cc:227:14: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
os << m[i][j] << " ";
˜ ^
replaceleda.cc:227:17: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
os << m[i][j] << " ";
˜ ^
replaceleda.cc:249:38: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
replaceleda::mmatrix<double> result(N,M,dummy);
˜˜˜˜˜˜ ^
replaceleda.cc:249:40: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
replaceleda::mmatrix<double> result(N,M,dummy);
˜˜˜˜˜˜ ^
replaceleda.cc:269:35: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
replaceleda::mmatrix<int> result(N,M,dummy);
˜˜˜˜˜˜ ^
replaceleda.cc:269:37: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
replaceleda::mmatrix<int> result(N,M,dummy);
˜˜˜˜˜˜ ^
replaceleda.cc:349:5: warning: expression result unused [-Wunused-value]
forall_nodes(v, g){
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
replaceleda.cc:353:2: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e, v){
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
replaceleda.cc:370:5: warning: expression result unused [-Wunused-value]
forall_nodes(v, g){
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:16:55: note: expanded from macro 'forall_nodes'
#define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() , n = G.getNode(icount);++icount)
˜˜˜˜˜˜ ^
replaceleda.cc:374:2: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
forall_out_edges(e, v){
^˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜˜
./include/Graph.hh:18:80: note: expanded from macro 'forall_out_edges'
#define forall_out_edges(e,n) for(uint kcount = 0; e = n->out_edges().get_item(kcount) , kcount < n->out_edges().size()/*graph_of(n)->outdeg(n)*/; kcount++)
^˜˜˜˜˜
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:53:78: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
T get_item(int pos) {if ((uint)pos < backpoint::size())return backpoint::at(pos); return T(0);}
˜˜˜˜˜˜˜˜˜ ^˜˜
./include/Graph.hh:79:39: note: in instantiation of member function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Node> >::get_item' requested here
node getNode(uint n){ return mynodes.get_item(n);}
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:7:
In file included from ./include/Graph.hh:9:
In file included from ./include/Edge_Array.hh:6:
./include/List.hh:53:78: warning: implicit conversion changes signedness: 'int' to 'size_type' (aka 'unsigned long') [-Wsign-conversion]
T get_item(int pos) {if ((uint)pos < backpoint::size())return backpoint::at(pos); return T(0);}
˜˜˜˜˜˜˜˜˜ ^˜˜
./include/Graph.hh:167:39: note: in instantiation of member function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Edge> >::get_item' requested here
edge getEdge(uint e){ return myedges.get_item(e);}
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:147:21: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim1(){ return N; }
˜˜˜˜˜˜ ^
replaceleda.cc:212:13: note: in instantiation of member function 'replaceleda::mmatrix<double>::dim1' requested here
os << m.dim1() << " " << m.dim2() << std::endl;
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:148:21: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim2(){ return M; }
˜˜˜˜˜˜ ^
replaceleda.cc:212:32: note: in instantiation of member function 'replaceleda::mmatrix<double>::dim2' requested here
os << m.dim1() << " " << m.dim2() << std::endl;
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:147:21: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim1(){ return N; }
˜˜˜˜˜˜ ^
replaceleda.cc:223:13: note: in instantiation of member function 'replaceleda::mmatrix<int>::dim1' requested here
os << m.dim1() << " " << m.dim2() << std::endl;
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:148:21: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim2(){ return M; }
˜˜˜˜˜˜ ^
replaceleda.cc:223:32: note: in instantiation of member function 'replaceleda::mmatrix<int>::dim2' requested here
os << m.dim1() << " " << m.dim2() << std::endl;
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
replaceleda.cc:246:8: note: in instantiation of member function 'replaceleda::mvector<double>::push_back' requested here
dummy.push_back(e);
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:110:20: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim(){ return D;}
˜˜˜˜˜˜ ^
replaceleda.cc:248:14: note: in instantiation of member function 'replaceleda::mvector<double>::dim' requested here
if(dummy.dim() == N * M){
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:33:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
D = v2.dim();
˜ ^˜˜˜˜˜˜˜
/usr/include/c++/4.2.1/bits/stl_algobase.h:433:18: note: in instantiation of member function 'replaceleda::mvector<double>::operator=' requested here
*--__result = *--__last;
^
/usr/include/c++/4.2.1/bits/stl_algobase.h:463:14: note: in instantiation of function template specialization 'std::__copy_backward<false, std::random_access_iterator_tag>::__copy_b<replaceleda::mvector<double> *, replaceleda::mvector<double> *>' requested here
return std::__copy_backward<__simple, _Category>::__copy_b(__first,
^
/usr/include/c++/4.2.1/bits/stl_algobase.h:474:18: note: in instantiation of function template specialization 'std::__copy_backward_aux<replaceleda::mvector<double> *, replaceleda::mvector<double> *>' requested here
{ return std::__copy_backward_aux(__first, __last, __result); }
^
/usr/include/c++/4.2.1/bits/stl_algobase.h:538:14: note: in instantiation of function template specialization 'std::__copy_backward_normal<false, false>::__copy_b_n<replaceleda::mvector<double> *, replaceleda::mvector<double> *>' requested here
return std::__copy_backward_normal<__bi1, __bi2>::__copy_b_n(__first,
^
/usr/include/c++/4.2.1/bits/vector.tcc:324:5: note: in instantiation of function template specialization 'std::copy_backward<replaceleda::mvector<double> *, replaceleda::mvector<double> *>' requested here
std::copy_backward(__position.base(), __old_finish - __n,
^
/usr/include/c++/4.2.1/bits/stl_vector.h:656:9: note: in instantiation of member function 'std::vector<replaceleda::mvector<double>, std::allocator<replaceleda::mvector<double> > >::_M_fill_insert' requested here
{ _M_fill_insert(__position, __n, __x); }
^
/usr/include/c++/4.2.1/bits/stl_vector.h:424:4: note: in instantiation of member function 'std::vector<replaceleda::mvector<double>, std::allocator<replaceleda::mvector<double> > >::insert' requested here
insert(end(), __new_size - size(), __x);
^
./include/Vector.hh:13:22: note: in instantiation of member function 'std::vector<replaceleda::mvector<double>, std::allocator<replaceleda::mvector<double> > >::resize' requested here
mvector(): D(0) { v.resize(0);}
^
./include/Matrix.hh:49:2: note: in instantiation of member function 'replaceleda::mvector<replaceleda::mvector<double> >::mvector' requested here
mmatrix(uint n, uint m, mvector<T> D) : N(n), M(m){
^
replaceleda.cc:249:31: note: in instantiation of member function 'replaceleda::mmatrix<double>::mmatrix' requested here
replaceleda::mmatrix<double> result(N,M,dummy);
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Matrix.hh:56:10: note: in instantiation of member function 'replaceleda::mvector<replaceleda::mvector<double> >::push_back' requested here
mx.push_back(dummy);
^
replaceleda.cc:249:31: note: in instantiation of member function 'replaceleda::mmatrix<double>::mmatrix' requested here
replaceleda::mmatrix<double> result(N,M,dummy);
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:90:18: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
mx.push_back(m[j]);
˜ ^
replaceleda.cc:250:4: note: in instantiation of member function 'replaceleda::mmatrix<double>::operator=' requested here
m = result;
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:91:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
N=m.dim1();
˜^˜˜˜˜˜˜˜
./include/Matrix.hh:92:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
M=m.dim2();
˜^˜˜˜˜˜˜˜
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
replaceleda.cc:266:8: note: in instantiation of member function 'replaceleda::mvector<int>::push_back' requested here
dummy.push_back(e);
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:110:20: warning: implicit conversion changes signedness: 'uint' (aka 'unsigned int') to 'int' [-Wsign-conversion]
int dim(){ return D;}
˜˜˜˜˜˜ ^
replaceleda.cc:268:14: note: in instantiation of member function 'replaceleda::mvector<int>::dim' requested here
if(dummy.dim() == N * M){
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:33:10: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
D = v2.dim();
˜ ^˜˜˜˜˜˜˜
/usr/include/c++/4.2.1/bits/stl_algobase.h:433:18: note: in instantiation of member function 'replaceleda::mvector<int>::operator=' requested here
*--__result = *--__last;
^
/usr/include/c++/4.2.1/bits/stl_algobase.h:463:14: note: in instantiation of function template specialization 'std::__copy_backward<false, std::random_access_iterator_tag>::__copy_b<replaceleda::mvector<int> *, replaceleda::mvector<int> *>' requested here
return std::__copy_backward<__simple, _Category>::__copy_b(__first,
^
/usr/include/c++/4.2.1/bits/stl_algobase.h:474:18: note: in instantiation of function template specialization 'std::__copy_backward_aux<replaceleda::mvector<int> *, replaceleda::mvector<int> *>' requested here
{ return std::__copy_backward_aux(__first, __last, __result); }
^
/usr/include/c++/4.2.1/bits/stl_algobase.h:538:14: note: in instantiation of function template specialization 'std::__copy_backward_normal<false, false>::__copy_b_n<replaceleda::mvector<int> *, replaceleda::mvector<int> *>' requested here
return std::__copy_backward_normal<__bi1, __bi2>::__copy_b_n(__first,
^
/usr/include/c++/4.2.1/bits/vector.tcc:324:5: note: in instantiation of function template specialization 'std::copy_backward<replaceleda::mvector<int> *, replaceleda::mvector<int> *>' requested here
std::copy_backward(__position.base(), __old_finish - __n,
^
/usr/include/c++/4.2.1/bits/stl_vector.h:656:9: note: in instantiation of member function 'std::vector<replaceleda::mvector<int>, std::allocator<replaceleda::mvector<int> > >::_M_fill_insert' requested here
{ _M_fill_insert(__position, __n, __x); }
^
/usr/include/c++/4.2.1/bits/stl_vector.h:424:4: note: in instantiation of member function 'std::vector<replaceleda::mvector<int>, std::allocator<replaceleda::mvector<int> > >::insert' requested here
insert(end(), __new_size - size(), __x);
^
./include/Vector.hh:13:22: note: in instantiation of member function 'std::vector<replaceleda::mvector<int>, std::allocator<replaceleda::mvector<int> > >::resize' requested here
mvector(): D(0) { v.resize(0);}
^
./include/Matrix.hh:49:2: note: in instantiation of member function 'replaceleda::mvector<replaceleda::mvector<int> >::mvector' requested here
mmatrix(uint n, uint m, mvector<T> D) : N(n), M(m){
^
replaceleda.cc:269:28: note: in instantiation of member function 'replaceleda::mmatrix<int>::mmatrix' requested here
replaceleda::mmatrix<int> result(N,M,dummy);
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
In file included from ./include/Matrix.hh:5:
./include/Vector.hh:99:10: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
D = v.size();
˜ ^˜˜˜˜˜˜˜
./include/Matrix.hh:56:10: note: in instantiation of member function 'replaceleda::mvector<replaceleda::mvector<int> >::push_back' requested here
mx.push_back(dummy);
^
replaceleda.cc:269:28: note: in instantiation of member function 'replaceleda::mmatrix<int>::mmatrix' requested here
replaceleda::mmatrix<int> result(N,M,dummy);
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:90:18: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
mx.push_back(m[j]);
˜ ^
replaceleda.cc:270:4: note: in instantiation of member function 'replaceleda::mmatrix<int>::operator=' requested here
m = result;
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:91:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
N=m.dim1();
˜^˜˜˜˜˜˜˜
./include/Matrix.hh:92:8: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
M=m.dim2();
˜^˜˜˜˜˜˜˜
./include/Matrix.hh:157:23: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
dummy.push_back(col(j));
˜˜˜ ^
replaceleda.cc:279:14: note: in instantiation of member function 'replaceleda::mmatrix<double>::trans' requested here
return m.trans();
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:83:23: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
result.push_back(mx[i][j]);
˜˜ ^
./include/Matrix.hh:157:19: note: in instantiation of member function 'replaceleda::mmatrix<double>::col' requested here
dummy.push_back(col(j));
^
replaceleda.cc:279:14: note: in instantiation of member function 'replaceleda::mmatrix<double>::trans' requested here
return m.trans();
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:22:8: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
N=vv.size();
˜^˜˜˜˜˜˜˜˜
./include/Matrix.hh:159:17: note: in instantiation of member function 'replaceleda::mmatrix<double>::mmatrix' requested here
mmatrix<T> result(dummy);
^
replaceleda.cc:279:14: note: in instantiation of member function 'replaceleda::mmatrix<double>::trans' requested here
return m.trans();
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:157:23: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
dummy.push_back(col(j));
˜˜˜ ^
replaceleda.cc:283:14: note: in instantiation of member function 'replaceleda::mmatrix<int>::trans' requested here
return m.trans();
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:83:23: warning: implicit conversion changes signedness: 'int' to 'uint' (aka 'unsigned int') [-Wsign-conversion]
result.push_back(mx[i][j]);
˜˜ ^
./include/Matrix.hh:157:19: note: in instantiation of member function 'replaceleda::mmatrix<int>::col' requested here
dummy.push_back(col(j));
^
replaceleda.cc:283:14: note: in instantiation of member function 'replaceleda::mmatrix<int>::trans' requested here
return m.trans();
^
In file included from replaceleda.cc:2:
In file included from ./include/replaceleda.hh:10:
./include/Matrix.hh:22:8: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'uint' (aka 'unsigned int') [-Wshorten-64-to-32]
N=vv.size();
˜^˜˜˜˜˜˜˜˜
./include/Matrix.hh:159:17: note: in instantiation of member function 'replaceleda::mmatrix<int>::mmatrix' requested here
mmatrix<T> result(dummy);
^
replaceleda.cc:283:14: note: in instantiation of member function 'replaceleda::mmatrix<int>::trans' requested here
return m.trans();
^
53 warnings generated.
clang++ -dynamiclib -Wl,-headerpad_max_install_names -undefined dynamic_lookup -single_module -multiply_defined suppress -L/usr/local/lib -L/usr/local/lib -o Rtreemix.so Rtreemix.o WrapGraph.o cfunctions.o kmeans.o max_weight_branch.o mtree.o mtreemix.o replaceleda.o -lm -F/Library/Frameworks/R.framework/.. -framework R -Wl,-framework -Wl,CoreFoundation
installing to /Users/biocbuild/bbs-2.12-bioc/meat/Rtreemix.buildbin-libdir/Rtreemix/libs
** R
** data
** inst
** preparing package for lazy loading
Warning: replacing previous import 'plot' when loading 'graphics'
Creating a generic function for 'print' from package 'base' in package 'Rtreemix'
** help
*** installing help indices
** building package indices
** installing vignettes
** testing if installed package can be loaded
Warning: replacing previous import 'plot' when loading 'graphics'
* DONE (Rtreemix)
>>>>>>>
>>>>>>> FIXING LINKS FOR Rtreemix.buildbin-libdir/Rtreemix/libs//Rtreemix.so
>>>>>>>
install_name_tool -change "/usr/local/lib/libgcc_s.1.dylib" "/Library/Frameworks/R.framework/Versions/3.0/Resources/lib/libgcc_s.1.dylib" "Rtreemix.buildbin-libdir/Rtreemix/libs//Rtreemix.so"
install_name_tool -change "/usr/local/lib/libgfortran.2.dylib" "/Library/Frameworks/R.framework/Versions/3.0/Resources/lib/libgfortran.2.dylib" "Rtreemix.buildbin-libdir/Rtreemix/libs//Rtreemix.so"
install_name_tool -change "/usr/local/lib/libreadline.5.2.dylib" "/Library/Frameworks/R.framework/Versions/3.0/Resources/lib/libreadline.5.2.dylib" "Rtreemix.buildbin-libdir/Rtreemix/libs//Rtreemix.so"
install_name_tool -change "/usr/local/lib/libreadline.dylib" "/Library/Frameworks/R.framework/Versions/3.0/Resources/lib/libreadline.dylib" "Rtreemix.buildbin-libdir/Rtreemix/libs//Rtreemix.so"