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

Improve log message.

Browse Source
This commit is contained in:
MarcosPividori
2016-06-22 15:09:07 -03:00
parent 7f4dfd005a
commit 49822ef417
1 changed files with 8 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/mlpack/methods/neighbor_search/ns_model_impl.hpp
+8 -8
View File
@@ -414,16 +414,16 @@ void NSModel<SortPolicy>::Search(arma::mat&& querySet,
if (randomBasis)
querySet = q * querySet;
Log::Info << "Searching for " << k;
if (Epsilon() != 0)
Log::Info << " approximate (e=" << Epsilon() << ")";
Log::Info << " neighbors with ";
Log::Info << "Searching for " << k << " neighbors with ";
if (!Naive() && !SingleMode())
Log::Info << "dual-tree " << TreeName() << " search..." << std::endl;
else if (!Naive())
Log::Info << "single-tree " << TreeName() << " search..." << std::endl;
else
Log::Info << "brute-force (naive) search..." << std::endl;
if (Epsilon() != 0 && !Naive())
Log::Info << "Maximum of " << Epsilon() * 100 << "% relative error."
<< std::endl;
BiSearchVisitor<SortPolicy> search(querySet, k, neighbors, distances,
leafSize);
@@ -436,16 +436,16 @@ void NSModel<SortPolicy>::Search(const size_t k,
arma::Mat<size_t>& neighbors,
arma::mat& distances)
{
Log::Info << "Searching for " << k;
if (Epsilon() != 0)
Log::Info << " approximate (e=" << Epsilon() << ")";
Log::Info << " neighbors with ";
Log::Info << "Searching for " << k << " neighbors with ";
if (!Naive() && !SingleMode())
Log::Info << "dual-tree " << TreeName() << " search..." << std::endl;
else if (!Naive())
Log::Info << "single-tree " << TreeName() << " search..." << std::endl;
else
Log::Info << "brute-force (naive) search..." << std::endl;
if (Epsilon() != 0 && !Naive())
Log::Info << "Maximum of " << Epsilon() * 100 << "% relative error."
<< std::endl;
MonoSearchVisitor search(k, neighbors, distances);
boost::apply_visitor(search, nSearch);