31 Impl(
bool preferNotLocked_r )
39 friend Impl * rwcowClone<Impl>(
const Impl * rhs );
42 {
return new Impl( *
this ); }
75 else if ( ccand.status().isLocked() )
88 Container::const_iterator it( container.find( ident_r ) );
89 return it != container.end() ? it->second :
PoolItem();
void _ctor_init()
bin.compat legacy
std::unordered_map< IdString, PoolItem > Container
IdString ident() const
The identifier.
shared_ptr< void > _dont_use_this_use_pimpl
Avoid need to include Impl definition when inlined ctors (due to tepmlate) are provided.
iterator begin() const
Pointer to the first PoolItem.
size_type size() const
Number of PoolItems collected.
Access to the sat-pools string space.
PoolItem find(IdString ident_r) const
Return the collected PoolItem with sat::Solvable::ident ident_r.
std::ostream & dumpRange(std::ostream &str, TIterator begin, TIterator end, const std::string &intro="{", const std::string &pfx="\n ", const std::string &sep="\n ", const std::string &sfx="\n", const std::string &extro="}")
Print range defined by iterators (multiline style).
std::ostream & operator<<(std::ostream &str, const Exception &obj)
ResStatus & status() const
Returns the current status.
Find the best candidates e.g.
const Container & container() const
Solvable satSolvable() const
Return the corresponding sat::Solvable.
Impl(bool preferNotLocked_r)
PoolItemBest implementation.
RWCOW_pointer< Impl > & pimpl()
Pointer to implementation.
Combining sat::Solvable and ResStatus.
void add(sat::Solvable slv_r)
Feed one sat::Solvable.
iterator end() const
Pointer behind the last PoolItem.
Impl * clone() const
clone for RWCOW_pointer
Oder on AvailableItemSet.