Changeset 1357 for applications/robust/robustlib.h

Timestamp:

05/06/11 16:25:00 (13 years ago)

Author:

sindj

Message:

Opravena chyba s uvolnovanim pameti pri ruseni ve for_merging poli a dalsi drobne nedostatky. JS

Files:

• applications/robust/robustlib.h (modified) (8 diffs)

applications/robust/robustlib.h

@@ -22 +22 @@
 using namespace itpp;
 
-const double max_range = 50;//numeric_limits<double>::max()/10e-10;
+const double max_range = 5;//numeric_limits<double>::max()/10e-10;
 
 /// An enumeration of possible actions performed on the polyhedrons. We can merge them or split them.
@@ -924 +924 @@
                                         case 0:
                                                 current_parent->neutralchildren.push_back(sender);
-                                                current_parent->positiveneutralvertices.insert(sender->positiveneutralvertices.begin(),sender->positiveneutralvertices.end());
-                                                current_parent->negativeneutralvertices.insert(sender->negativeneutralvertices.begin(),sender->negativeneutralvertices.end());                                          
+
+                                                if(level!=0)
+                                                {
+                                                        current_parent->positiveneutralvertices.insert(sender->positiveneutralvertices.begin(),sender->positiveneutralvertices.end());
+                                                        current_parent->negativeneutralvertices.insert(sender->negativeneutralvertices.begin(),sender->negativeneutralvertices.end());                                          
+                                                }
+                                                else
+                                                {
+                                                        current_parent->positiveneutralvertices.insert(*sender->vertices.begin());
+                                                        current_parent->negativeneutralvertices.insert(*sender->vertices.begin());
+                                                }
 
                                                 if(sender->totally_neutral)
@@ -1317 +1326 @@
 
                                                 current_vertex->raise_multiplicity();
-                                                current_vertex->parentconditions.insert(condition_to_add);
-
-                                                current_vertex->negativeneutralvertices.insert(current_vertex);
-                                                current_vertex->positiveneutralvertices.insert(current_vertex);
+                                                current_vertex->parentconditions.insert(condition_to_add);                                              
                                         }
                                         else
@@ -1367 +1373 @@
                                 for(list<polyhedron*>::iterator merge_ref = for_merging[i].begin();merge_ref!=for_merging[i].end();merge_ref++)
                                 {
-                                        cout << (*merge_ref)->get_state(MERGE) << ",";
-                                }
-
-                                cout << endl;
+                                        
+                                        for(list<polyhedron*>::iterator par_ref = (*merge_ref)->children.begin();par_ref!=(*merge_ref)->children.end();par_ref++)
+                                        {
+                                                if(find((*par_ref)->parents.begin(),(*par_ref)->parents.end(),(*merge_ref))==(*par_ref)->parents.end())
+                                                {
+                                                        cout << "Parent/child relations are not matched!" << endl;
+                                                }
+                                        }
+                                        
+                                        //cout << (*merge_ref)->get_state(MERGE) << ",";
+                                }
+
+                                // cout << endl;
                         }
                         */
+                        
+                        
 
                         cout << "Merging." << endl;
@@ -1591 +1608 @@
                                                 {
                                                         (*grand_p_ref)->totallyneutralgrandchildren.erase(*merge_ref);
-                                                }
+                                                }                               
+
+                                                statistic.delete_polyhedron(k-1,*merge_ref);
+
                                                 
-                                                for_splitting[k-1].remove(*merge_ref);
-
-                                                statistic.delete_polyhedron(k-1,*merge_ref);
 
                                                 if(k==1)
-                                                {
+                                                {                                                       
                                                         vertices_to_be_reduced.insert((vertex*)(*merge_ref));
+                                                        for_splitting[k-1].remove(*merge_ref);
                                                 }
                                                 else
                                                 {
-                                                        delete *merge_ref;
+                                                        delete (*merge_ref);
+                                                        for_splitting[k-1].remove(*merge_ref);
                                                 }
                                         }
@@ -1620 +1639 @@
                                 else
                                 {
-                                        delete *vert_ref;
+                                        delete (*vert_ref);
                                 }
                         }
@@ -1812 +1831 @@
                 */
 
-                cout << "Normalization factor: " << normalization_factor << endl;       
+                // cout << "Normalization factor: " << normalization_factor << endl;    
 
                 log_nc = log(normalization_factor) + logfact(condition_order-number_of_parameters-2);
@@ -2708 +2727 @@
                         
                         yt.ins(c_size,1.0);
-                }
-                
+                }               
+
                 if(yt.size() == posterior->number_of_parameters+1)
                 {