1 /* -*- Mode: C++; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 4 -*- */
4 * Copyright (C) 2008 SUSE Linux Products GmbH
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License,
8 * version 2, as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
22 #include <solv/solver.h>
25 #define ZYPP_USE_RESOLVER_INTERNALS
27 #include <zypp/base/Logger.h>
28 #include <zypp/solver/detail/SolverQueueItem.h>
32 /////////////////////////////////////////////////////////////////////////
34 { ///////////////////////////////////////////////////////////////////////
35 ///////////////////////////////////////////////////////////////////////
37 { /////////////////////////////////////////////////////////////////////
38 /////////////////////////////////////////////////////////////////////
40 { ///////////////////////////////////////////////////////////////////
43 IMPL_PTR_TYPE(SolverQueueItem);
45 //---------------------------------------------------------------------------
48 SolverQueueItem::dumpOn( std::ostream & os ) const
51 case QUEUE_ITEM_TYPE_UNKNOWN : os << "unknown"; break;
52 case QUEUE_ITEM_TYPE_UPDATE : os << "update"; break;
53 case QUEUE_ITEM_TYPE_LOCK : os << "lock"; break;
54 case QUEUE_ITEM_TYPE_INSTALL : os << "install"; break;
55 case QUEUE_ITEM_TYPE_DELETE : os << "delete"; break;
56 case QUEUE_ITEM_TYPE_INSTALL_ONE_OF: os << "install one of"; break;
57 default: os << "?solverqueueitem?"; break;
64 operator<<( std::ostream & os, const SolverQueueItemList & itemlist )
66 for (SolverQueueItemList::const_iterator iter = itemlist.begin(); iter != itemlist.end(); ++iter) {
67 if (iter != itemlist.begin())
68 os << "," << endl << "\t";
74 //---------------------------------------------------------------------------
76 SolverQueueItem::SolverQueueItem (SolverQueueItemType type, const ResPool & pool)
83 SolverQueueItem::~SolverQueueItem()
87 //---------------------------------------------------------------------------
90 SolverQueueItem::copy (const SolverQueueItem *from)
95 //---------------------------------------------------------------------------
98 ///////////////////////////////////////////////////////////////////
100 /////////////////////////////////////////////////////////////////////
101 /////////////////////////////////////////////////////////////////////
102 };// namespace solver
103 ///////////////////////////////////////////////////////////////////////
104 ///////////////////////////////////////////////////////////////////////
106 /////////////////////////////////////////////////////////////////////////