apaam/mlpack
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Another bug fix.

Browse Source
This commit is contained in:
Dongryeol Lee
2010-11-20 18:59:37 +00:00
parent b36dd933a5
commit abfebbb40a
1 changed files with 16 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
fastlib/trunk/contrib/dongryel/thesis_research/core/gnp/tripletree_dfs_dev.h
+16
View File
@@ -276,6 +276,13 @@ bool core::gnp::TripletreeDfs<ProblemType>::CanProbabilisticSummarize_(
typename ProblemType::DeltaType &delta,
typename ProblemType::ResultType *query_results) {
// Since we have turned on the monochromatic trick, fail if all
// three nodes are equal.
if(range_in.node(0) == range_in.node(1) &&
range_in.node(1) == range_in.node(2)) {
return false;
}
// If there are too many tuples to approximate, then don't try.
if(std::max(
range_in.num_tuples(0), std::max(
@@ -381,6 +388,15 @@ bool core::gnp::TripletreeDfs<ProblemType>::CanSummarize_(
typename ProblemType::ResultType *query_results,
int *failure_index) {
// Since we have turned on the monochromatic trick, fail if all
// three nodes are equal.
if(triple_range_distance_sq_in.node(0) ==
triple_range_distance_sq_in.node(1) &&
triple_range_distance_sq_in.node(1) ==
triple_range_distance_sq_in.node(2)) {
return false;
}
std::vector< typename ProblemType::SummaryType > new_summaries;
new_summaries.resize(3);