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 #include "zypp/base/Logger.h"
26 #include "zypp/IdString.h"
27 #include "zypp/Resolver.h"
28 #include "zypp/solver/detail/SolverQueueItemDelete.h"
30 /////////////////////////////////////////////////////////////////////////
32 { ///////////////////////////////////////////////////////////////////////
33 ///////////////////////////////////////////////////////////////////////
35 { /////////////////////////////////////////////////////////////////////
36 /////////////////////////////////////////////////////////////////////
38 { ///////////////////////////////////////////////////////////////////
42 IMPL_PTR_TYPE(SolverQueueItemDelete);
44 //---------------------------------------------------------------------------
47 SolverQueueItemDelete::dumpOn( std::ostream & os ) const
49 os << "[" << (_soft?"Soft":"") << "Delete: "
55 //---------------------------------------------------------------------------
57 SolverQueueItemDelete::SolverQueueItemDelete (const ResPool & pool, std::string name, bool soft)
58 : SolverQueueItem (QUEUE_ITEM_TYPE_DELETE, pool)
65 SolverQueueItemDelete::~SolverQueueItemDelete()
69 //---------------------------------------------------------------------------
71 bool SolverQueueItemDelete::addRule (sat::detail::CQueue & q)
73 #define MAYBE_CLEANDEPS (pool().resolver().cleandepsOnRemove()?SOLVER_CLEANDEPS:0)
75 ::Id id = IdString(_name).id();
77 queue_push( &(q), SOLVER_ERASE | SOLVER_SOLVABLE_NAME | SOLVER_WEAK | MAYBE_CLEANDEPS );
79 queue_push( &(q), SOLVER_ERASE | SOLVER_SOLVABLE_NAME | MAYBE_CLEANDEPS );
81 queue_push( &(q), id);
83 MIL << "Delete " << _name << (_soft ? "(soft)" : "")
84 << " with SAT-Pool: " << id << endl;
89 SolverQueueItemDelete::copy (void) const
91 SolverQueueItemDelete_Ptr new_delete = new SolverQueueItemDelete (pool(), _name);
92 new_delete->SolverQueueItem::copy(this);
94 new_delete->_soft = _soft;
99 SolverQueueItemDelete::cmp (SolverQueueItem_constPtr item) const
101 int cmp = this->compare (item);
104 SolverQueueItemDelete_constPtr del = dynamic_pointer_cast<const SolverQueueItemDelete>(item);
105 if (_name != del->_name) {
106 return _name.compare(del->_name);
111 //---------------------------------------------------------------------------
114 ///////////////////////////////////////////////////////////////////
115 };// namespace detail
116 /////////////////////////////////////////////////////////////////////
117 /////////////////////////////////////////////////////////////////////
118 };// namespace solver
119 ///////////////////////////////////////////////////////////////////////
120 ///////////////////////////////////////////////////////////////////////
122 /////////////////////////////////////////////////////////////////////////