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/IdString.h"
29 #include "zypp/Resolver.h"
30 #include "zypp/solver/detail/SolverQueueItemDelete.h"
32 /////////////////////////////////////////////////////////////////////////
34 { ///////////////////////////////////////////////////////////////////////
35 ///////////////////////////////////////////////////////////////////////
37 { /////////////////////////////////////////////////////////////////////
38 /////////////////////////////////////////////////////////////////////
40 { ///////////////////////////////////////////////////////////////////
44 IMPL_PTR_TYPE(SolverQueueItemDelete);
46 //---------------------------------------------------------------------------
49 SolverQueueItemDelete::dumpOn( std::ostream & os ) const
51 os << "[" << (_soft?"Soft":"") << "Delete: "
57 //---------------------------------------------------------------------------
59 SolverQueueItemDelete::SolverQueueItemDelete (const ResPool & pool, std::string name, bool soft)
60 : SolverQueueItem (QUEUE_ITEM_TYPE_DELETE, pool)
67 SolverQueueItemDelete::~SolverQueueItemDelete()
71 //---------------------------------------------------------------------------
73 bool SolverQueueItemDelete::addRule (sat::detail::CQueue & q)
75 #define MAYBE_CLEANDEPS (pool().resolver().cleandepsOnRemove()?SOLVER_CLEANDEPS:0)
77 ::Id id = IdString(_name).id();
79 queue_push( &(q), SOLVER_ERASE | SOLVER_SOLVABLE_NAME | SOLVER_WEAK | MAYBE_CLEANDEPS );
81 queue_push( &(q), SOLVER_ERASE | SOLVER_SOLVABLE_NAME | MAYBE_CLEANDEPS );
83 queue_push( &(q), id);
85 MIL << "Delete " << _name << (_soft ? "(soft)" : "")
86 << " with SAT-Pool: " << id << endl;
91 SolverQueueItemDelete::copy (void) const
93 SolverQueueItemDelete_Ptr new_delete = new SolverQueueItemDelete (pool(), _name);
94 new_delete->SolverQueueItem::copy(this);
96 new_delete->_soft = _soft;
101 SolverQueueItemDelete::cmp (SolverQueueItem_constPtr item) const
103 int cmp = this->compare (item);
106 SolverQueueItemDelete_constPtr del = dynamic_pointer_cast<const SolverQueueItemDelete>(item);
107 if (_name != del->_name) {
108 return _name.compare(del->_name);
113 //---------------------------------------------------------------------------
116 ///////////////////////////////////////////////////////////////////
117 };// namespace detail
118 /////////////////////////////////////////////////////////////////////
119 /////////////////////////////////////////////////////////////////////
120 };// namespace solver
121 ///////////////////////////////////////////////////////////////////////
122 ///////////////////////////////////////////////////////////////////////
124 /////////////////////////////////////////////////////////////////////////