dlvhex
2.5.0
|
00001 /* dlvhex -- Answer-Set Programming with external interfaces. 00002 * Copyright (C) 2005-2007 Roman Schindlauer 00003 * Copyright (C) 2006-2015 Thomas Krennwallner 00004 * Copyright (C) 2009-2016 Peter Schüller 00005 * Copyright (C) 2011-2016 Christoph Redl 00006 * Copyright (C) 2015-2016 Tobias Kaminski 00007 * Copyright (C) 2015-2016 Antonius Weinzierl 00008 * 00009 * This file is part of dlvhex. 00010 * 00011 * dlvhex is free software; you can redistribute it and/or modify it 00012 * under the terms of the GNU Lesser General Public License as 00013 * published by the Free Software Foundation; either version 2.1 of 00014 * the License, or (at your option) any later version. 00015 * 00016 * dlvhex is distributed in the hope that it will be useful, but 00017 * WITHOUT ANY WARRANTY; without even the implied warranty of 00018 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00019 * Lesser General Public License for more details. 00020 * 00021 * You should have received a copy of the GNU Lesser General Public 00022 * License along with dlvhex; if not, write to the Free Software 00023 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 00024 * 02110-1301 USA. 00025 */ 00026 00034 #ifdef HAVE_CONFIG_H 00035 #include "config.h" 00036 #endif // HAVE_CONFIG_H 00037 00038 #include "dlvhex2/CAUAlgorithms.h" 00039 00040 namespace CAUAlgorithms 00041 { 00042 00043 void logAPM( 00044 const AncestryPropertyMap& apm) { 00045 DBGLOG_SCOPE(DBG,"apm",false); 00046 DBGLOG(DBG,"logging AncestryPropertyMap:"); 00047 std::vector<Ancestry>::const_iterator it; 00048 unsigned u = 0; 00049 for(it = apm.storage_begin(); 00050 it != apm.storage_end(); ++it, ++u) { 00051 const Ancestry& anc = *it; 00052 DBGLOG(DBG,"unit " << u << ": " << printset(anc)); 00053 } 00054 } 00055 00056 void logJRPM(const JoinRelevancePropertyMap& jr) { 00057 DBGLOG_SCOPE(DBG,"jrpm",false); 00058 DBGLOG(DBG,"logging JoinRelevancePropertyMap:"); 00059 std::vector<bool>::const_iterator it; 00060 unsigned u = 0; 00061 for(it = jr.storage_begin(); 00062 it != jr.storage_end(); ++it, ++u) { 00063 DBGLOG(DBG,"unit " << u << ": " << ((*it == true) ? 00064 std::string("relevant") : std::string("irrelevant")) ); 00065 } 00066 } 00067 00068 } // namespace CAUAlgorithms 00069 00070 // vim:expandtab:ts=4:sw=4: 00071 // mode: C++ 00072 // End: