/usr/include/x86_64-linux-gnu/zypp/ResStatus.h is in libzypp-dev 14.29.1-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 | /*---------------------------------------------------------------------\
| ____ _ __ __ ___ |
| |__ / \ / / . \ . \ |
| / / \ V /| _/ _/ |
| / /__ | | | | | | |
| /_____||_| |_| |_| |
| |
\---------------------------------------------------------------------*/
/** \file zypp/ResStatus.h
*
*/
#ifndef ZYPP_RESSTATUS_H
#define ZYPP_RESSTATUS_H
#include <inttypes.h>
#include <iosfwd>
#include "zypp/Bit.h"
///////////////////////////////////////////////////////////////////
namespace zypp
{ /////////////////////////////////////////////////////////////////
namespace resstatus
{
class UserLockQueryManip;
class StatusBackup;
}
///////////////////////////////////////////////////////////////////
//
// CLASS NAME : ResStatus
//
/** Status bitfield.
*
* \li \c StateField Whether the resolvable is or uninstalled (available).
* \li \c ValidateField Validate status computed by the solver as
* nonrelevant: it is unimportant for the user
* satisfied: it important nothing has to be done
* broken: it is incomplete. So e.g. an update is needed
* \li \c TransactField Whether to transact this resolvable
* (delete if installed install if uninstalled).
* In case the resolvable is locked, only USER may modify the
* transact bit.
* \li \c TransactByField Who triggered the transaction. Transaction
* bit may be reset by higer levels only.
* \li \c TransactDetailField Reason why the Resolvable transacts.
* Splitted into \c InstallDetailValue and \c RemoveDetailValue
* dependent on the kind of transaction.
* \li \c WeakField The solvable will be recommended/suggested by
* a to be installed/deleted solvable.
*
*/
class ResStatus
{
friend std::ostream & operator<<( std::ostream & str, const ResStatus & obj );
friend bool operator==( const ResStatus & lhs, const ResStatus & rhs );
public:
/** \name BitField range definitions.
*
* \note Enlarge FieldType if more bit's needed. It's not yet
* checked by the compiler.
*/
//@{
typedef uint16_t FieldType;
typedef bit::BitField<FieldType> BitFieldType;
// Bit Ranges within FieldType defined by 1st bit and size:
typedef bit::Range<FieldType,0, 1> StateField;
typedef bit::Range<FieldType,StateField::end, 2> ValidateField;
typedef bit::Range<FieldType,ValidateField::end, 2> TransactField;
typedef bit::Range<FieldType,TransactField::end, 2> TransactByField;
typedef bit::Range<FieldType,TransactByField::end, 2> TransactDetailField;
typedef bit::Range<FieldType,TransactDetailField::end, 1> LicenceConfirmedField;
typedef bit::Range<FieldType,LicenceConfirmedField::end, 4> WeakField;
typedef bit::Range<FieldType,WeakField::end, 1> UserLockQueryField; // internal
// enlarge FieldType if more bit's needed. It's not yet
// checked by the compiler.
//@}
public:
/** \name Status values.
*
* Each enum corresponds to a BitField range.
* \note Take care that enumerator values actually fit into
* the corresponding field. It's not yet checked by the compiler.
*/
//@{
enum StateValue
{
UNINSTALLED = bit::RangeValue<StateField,0>::value,
INSTALLED = bit::RangeValue<StateField,1>::value
};
enum ValidateValue
{
UNDETERMINED = bit::RangeValue<ValidateField,0>::value,
BROKEN = bit::RangeValue<ValidateField,1>::value,
SATISFIED = bit::RangeValue<ValidateField,2>::value,
NONRELEVANT = bit::RangeValue<ValidateField,3>::value
};
enum TransactValue
{
KEEP_STATE = bit::RangeValue<TransactField,0>::value,
LOCKED = bit::RangeValue<TransactField,1>::value, // locked, must not transact
TRANSACT = bit::RangeValue<TransactField,2>::value // transact according to state
};
enum TransactByValue
{
SOLVER = bit::RangeValue<TransactByField,0>::value,
APPL_LOW = bit::RangeValue<TransactByField,1>::value,
APPL_HIGH = bit::RangeValue<TransactByField,2>::value,
USER = bit::RangeValue<TransactByField,3>::value
};
enum DetailValue
{
/** Detail for no transact, i.e. reset any Install/RemoveDetailValue. */
NO_DETAIL = bit::RangeValue<TransactDetailField,0>::value,
};
enum InstallDetailValue
{
EXPLICIT_INSTALL = bit::RangeValue<TransactDetailField,0>::value,
SOFT_INSTALL = bit::RangeValue<TransactDetailField,1>::value
};
enum RemoveDetailValue
{
EXPLICIT_REMOVE = bit::RangeValue<TransactDetailField,0>::value,
SOFT_REMOVE = bit::RangeValue<TransactDetailField,1>::value,
DUE_TO_OBSOLETE = bit::RangeValue<TransactDetailField,2>::value,
DUE_TO_UPGRADE = bit::RangeValue<TransactDetailField,3>::value
};
enum LicenceConfirmedValue
{
LICENCE_UNCONFIRMED = bit::RangeValue<LicenceConfirmedField,0>::value,
LICENCE_CONFIRMED = bit::RangeValue<LicenceConfirmedField,1>::value
};
enum WeakValue // Unlike the other fields those are BITS that may be or'ed!
{
NO_WEAK = bit::RangeValue<WeakField,0>::value,
SUGGESTED = bit::RangeValue<WeakField,1<<0>::value,
RECOMMENDED = bit::RangeValue<WeakField,1<<1>::value,
ORPHANED = bit::RangeValue<WeakField,1<<2>::value,
UNNEEDED = bit::RangeValue<WeakField,1<<3>::value
};
enum UserLockQuery // internal
{
USERLOCK_NOMATCH = bit::RangeValue<UserLockQueryField,0>::value,
USERLOCK_MATCH = bit::RangeValue<UserLockQueryField,1>::value
};
//@}
public:
/** Default ctor. */
ResStatus();
/** Ctor setting the initial . */
ResStatus( bool isInstalled_r );
/** Dtor. */
~ResStatus();
/** Debug helper returning the bitfield.
* It's save to expose the bitfield, as it can't be used to
* recreate a ResStatus. So it is not possible to bypass
* transition rules.
*/
BitFieldType bitfield() const
{ return _bitfield; }
public:
bool isLicenceConfirmed() const
{ return fieldValueIs<LicenceConfirmedField>( LICENCE_CONFIRMED ); }
void setLicenceConfirmed( bool toVal_r = true )
{ fieldValueAssign<LicenceConfirmedField>( toVal_r ? LICENCE_CONFIRMED : LICENCE_UNCONFIRMED ); }
public:
bool isRecommended() const
{ return _bitfield.test( RECOMMENDED ); }
bool isSuggested() const
{ return _bitfield.test( SUGGESTED ); }
bool isOrphaned() const
{ return _bitfield.test( ORPHANED ); }
bool isUnneeded() const
{ return _bitfield.test( UNNEEDED ); }
void resetWeak()
{ return fieldValueAssign<WeakField>( NO_WEAK ); }
void setRecommended( bool toVal_r = true )
{ _bitfield.set( RECOMMENDED, toVal_r ); }
void setSuggested( bool toVal_r = true )
{ _bitfield.set( SUGGESTED, toVal_r ); }
void setOrphaned( bool toVal_r = true )
{ _bitfield.set( ORPHANED, toVal_r ); }
void setUnneeded( bool toVal_r = true )
{ _bitfield.set( UNNEEDED, toVal_r ); }
public:
ValidateValue validate() const
{ return (ValidateValue)_bitfield.value<ValidateField>(); }
bool isUndetermined() const
{ return fieldValueIs<ValidateField>( UNDETERMINED ); }
bool isSatisfied() const
{ return fieldValueIs<ValidateField>( SATISFIED ); }
bool isBroken() const
{ return fieldValueIs<ValidateField>( BROKEN ); }
bool isNonRelevant() const
{ return fieldValueIs<ValidateField>( NONRELEVANT ); }
public:
// These two are IMMUTABLE!
bool isInstalled() const
{ return fieldValueIs<StateField>( INSTALLED ); }
bool isUninstalled() const
{ return fieldValueIs<StateField>( UNINSTALLED ); }
public:
bool staysInstalled() const
{ return isInstalled() && !transacts(); }
bool wasInstalled() const { return staysInstalled(); } //for old status
bool isToBeInstalled() const
{ return isUninstalled() && transacts(); }
bool staysUninstalled() const
{ return isUninstalled() && !transacts(); }
bool wasUninstalled() const { return staysUninstalled(); } // for old status
bool isToBeUninstalled() const
{ return isInstalled() && transacts(); }
bool isLocked() const
{ return fieldValueIs<TransactField>( LOCKED ); }
bool isUserLocked() const
{ return isLocked() && isByUser(); }
bool isSoftLocked() const
{ return isKept() && ( isByApplLow() || isByUser() ); }
bool isKept() const
{ return fieldValueIs<TransactField>( KEEP_STATE ); }
bool transacts() const
{ return fieldValueIs<TransactField>( TRANSACT ); }
TransactValue getTransactValue() const
{ return (TransactValue)_bitfield.value<TransactField>(); }
/** True if would be on system after commit. */
bool onSystem() const
{ return( isInstalled() != transacts() ); }
/** True if would be off system after commit. */
bool offSystem() const
{ return ! onSystem(); }
bool isBySolver() const
{ return fieldValueIs<TransactByField>( SOLVER ); }
bool isByApplLow() const
{ return fieldValueIs<TransactByField>( APPL_LOW ); }
bool isByApplHigh() const
{ return fieldValueIs<TransactByField>( APPL_HIGH ); }
bool isByUser() const
{ return fieldValueIs<TransactByField>( USER ); }
TransactByValue getTransactByValue() const
{ return (TransactByValue)_bitfield.value<TransactByField>(); }
bool setTransactByValue(TransactByValue causer)
{
if ( isLessThan<TransactByField>( causer ) ) {
fieldValueAssign<TransactByField>( causer );
return true;
} else {
return false;
}
}
bool isToBeUninstalledDueToObsolete () const
{ return isToBeUninstalled() && fieldValueIs<TransactDetailField>( DUE_TO_OBSOLETE ); }
bool isToBeUninstalledDueToUpgrade() const
{ return isToBeUninstalled() && fieldValueIs<TransactDetailField>( DUE_TO_UPGRADE ); }
bool isToBeInstalledSoft () const
{ return isToBeInstalled() && fieldValueIs<TransactDetailField>( SOFT_INSTALL ); }
bool isToBeInstalledNotSoft () const
{ return isToBeInstalled() && !fieldValueIs<TransactDetailField>( SOFT_INSTALL ); }
bool isToBeUninstalledSoft () const
{ return isToBeUninstalled() && fieldValueIs<TransactDetailField>( SOFT_REMOVE ); }
private:
/** \name Internal hard lock maintainance */
//@{
friend class resstatus::UserLockQueryManip;
bool isUserLockQueryMatch() const
{ return fieldValueIs<UserLockQueryField>( USERLOCK_MATCH ); }
void setUserLockQueryMatch( bool match_r )
{ fieldValueAssign<UserLockQueryField>( match_r ? USERLOCK_MATCH : USERLOCK_NOMATCH ); }
//@}
public:
//------------------------------------------------------------------------
// get/set functions, returnig \c true if requested status change
// was successfull (i.e. leading to the desired transaction).
// If a lower level (e.g.SOLVER) wants to transact, but it's
// already set by a higher level, \c true should be returned.
// Removing a higher levels transaction bit should fail.
//
// The may functions checks only, if the action would return true
// if it is called.
/** Set TransactValue.
* Convenience to set TransactValue from enum.
*/
bool setTransactValue( TransactValue newVal_r, TransactByValue causer_r )
{
switch ( newVal_r )
{
case KEEP_STATE:
return setTransact( false, causer_r );
break;
case LOCKED:
return setLock( true, causer_r );
break;
case TRANSACT:
return setTransact( true, causer_r );
break;
}
return false;
}
bool maySetTransactValue( TransactValue newVal_r, TransactByValue causer_r )
{
bit::BitField<FieldType> savBitfield = _bitfield;
bool ret = setTransactValue( newVal_r, causer_r );
_bitfield = savBitfield;
return ret;
}
/** Apply a lock (prevent transaction).
* Currently by USER or APPL_HIGH only, but who knows...
* Set LOCKED from KEEP_STATE to be shure all transaction
* details were reset properly.
*/
bool setLock( bool toLock_r, TransactByValue causer_r )
{
if ( toLock_r == isLocked() )
{
// we're already in the desired state, but in case of
// LOCKED, remember a superior causer.
if ( isLocked() && isLessThan<TransactByField>( causer_r ) )
fieldValueAssign<TransactByField>( causer_r );
return true;
}
// Here: Lock status is to be changed:
if ( causer_r != USER && causer_r != APPL_HIGH )
return false;
if ( toLock_r ) {
// We're in unlocked state, which includes TRANSACT.
// Causer must be allowed to reset this. But from
// KEEP_STATE every causer is allowed to set the lock.
if ( ! setTransact( false, causer_r ) )
return false;
fieldValueAssign<TransactField>( LOCKED );
fieldValueAssign<TransactByField>( causer_r );
} else {
// To leave Locked state it needs a superior causer.
if ( isGreaterThan<TransactByField>( causer_r ) )
return false;
fieldValueAssign<TransactField>( KEEP_STATE );
fieldValueAssign<TransactByField>( SOLVER ); // reset to lowest causer
// in order to distinguish from keep_state_by_user
}
return true;
}
bool maySetLock( bool to_r, TransactByValue causer_r )
{
bit::BitField<FieldType> savBitfield = _bitfield;
bool ret = setLock( to_r, causer_r );
_bitfield = savBitfield;
return ret;
}
/** Toggle between TRANSACT and KEEP_STATE.
* LOCKED state means KEEP_STATE. But in contrary to KEEP_STATE,
* LOCKED state is immutable for \a causer_r less than TransactByValue.
* KEEP_STATE may be canged by any \a causer_r.
*/
bool setTransact( bool toTansact_r, TransactByValue causer_r )
{
if ( toTansact_r == transacts() )
{
// we're already in the desired state, but in case of
// TRANSACT, remember a superior causer.
if ( transacts() && isLessThan<TransactByField>( causer_r ) )
fieldValueAssign<TransactByField>( causer_r );
fieldValueAssign<TransactDetailField>( NO_DETAIL ); // Details has to be set again
return true;
}
// Here: transact status is to be changed:
if ( ! fieldValueIs<TransactField>( KEEP_STATE )
&& isGreaterThan<TransactByField>( causer_r ) ) {
return false;
}
if ( toTansact_r )
{
fieldValueAssign<TransactField>( TRANSACT );
}
else
{
fieldValueAssign<TransactField>( KEEP_STATE );
}
fieldValueAssign<TransactDetailField>( NO_DETAIL ); // Details has to be set again
fieldValueAssign<TransactByField>( causer_r );
return true;
}
bool maySetTransact( bool val_r, TransactByValue causer )
{
bit::BitField<FieldType> savBitfield = _bitfield;
bool ret = setTransact (val_r, causer);
_bitfield = savBitfield;
return ret;
}
/** */
bool setSoftLock( TransactByValue causer_r )
{
if ( ! setTransact( false, causer_r ) )
return false;
if ( fieldValueIs<TransactField>( KEEP_STATE )
&& isLessThan<TransactByField>( causer_r ) )
fieldValueAssign<TransactByField>( causer_r );
return true;
}
/** Not the same as setTransact( false ).
*/
bool resetTransact( TransactByValue causer_r )
{
if ( ! setTransact( false, causer_r ) )
return false;
if ( fieldValueIs<TransactField>( KEEP_STATE ) )
fieldValueAssign<TransactByField>( SOLVER );
return true;
}
/** Soft toggle between TRANSACT and KEEP_STATE.
* Similar to setTransact, but leaving KEEP_STATE also requires
* a superior \a causerLimit_r. So this is a kind of soft lock.
* \code
* // SOLVER wants to set TRANSACT, iff KEEP_STATE is
* // not superior to APPL_LOW.
* setSoftTransact( true, SOLVER, APPL_LOW );
* \endcode
*/
bool setSoftTransact( bool toTansact_r, TransactByValue causer_r,
TransactByValue causerLimit_r )
{
if ( fieldValueIs<TransactField>( KEEP_STATE )
&& toTansact_r != transacts()
&& isGreaterThan<TransactByField>( causerLimit_r ) )
{
// any transact status change requires a superior causer.
return false;
}
return setTransact( toTansact_r, causer_r );
}
bool setSoftTransact( bool toTansact_r, TransactByValue causer_r )
{ return setSoftTransact( toTansact_r, causer_r, causer_r ); }
bool maySetSoftTransact( bool val_r, TransactByValue causer,
TransactByValue causerLimit_r )
{
bit::BitField<FieldType> savBitfield = _bitfield;
bool ret = setSoftTransact( val_r, causer, causerLimit_r );
_bitfield = savBitfield;
return ret;
}
bool maySetSoftTransact( bool val_r, TransactByValue causer )
{ return maySetSoftTransact( val_r, causer, causer ); }
bool setToBeInstalled (TransactByValue causer)
{
if (isInstalled()) return false;
return setTransact (true, causer);
}
bool maySetToBeInstalled (TransactByValue causer)
{
bit::BitField<FieldType> savBitfield = _bitfield;
bool ret = setToBeInstalled (causer);
_bitfield = savBitfield;
return ret;
}
bool setToBeUninstalled (TransactByValue causer)
{
if (!isInstalled()) return false;
return setTransact (true, causer);
}
bool maySetToBeUninstalled (TransactByValue causer)
{
bit::BitField<FieldType> savBitfield = _bitfield;
bool ret = setToBeUninstalled (causer);
_bitfield = savBitfield;
return ret;
}
//------------------------------------------------------------------------
// *** These are only for the Resolver ***
bool setToBeUninstalledDueToObsolete ( )
{
if (!setToBeUninstalled (SOLVER)) return false;
fieldValueAssign<TransactDetailField>(DUE_TO_OBSOLETE);
return true;
}
bool setToBeUninstalledDueToUpgrade ( TransactByValue causer )
{
if (!setToBeUninstalled (causer)) return false;
fieldValueAssign<TransactDetailField>(DUE_TO_UPGRADE);
return true;
}
bool setToBeInstalledSoft ( )
{
if (isInstalled()
|| !setSoftTransact (true, SOLVER))
return false;
fieldValueAssign<TransactDetailField>(SOFT_INSTALL);
return true;
}
bool setToBeUninstalledSoft ( )
{
if (!isInstalled()
|| !setSoftTransact (true, SOLVER))
return false;
fieldValueAssign<TransactDetailField>(SOFT_REMOVE);
return true;
}
bool maySetToBeUninstalledSoft ()
{
bit::BitField<FieldType> savBitfield = _bitfield;
bool ret = setToBeUninstalledSoft ();
_bitfield = savBitfield;
return ret;
}
bool isSoftInstall () {
return fieldValueIs<TransactDetailField> (SOFT_INSTALL);
}
bool isSoftUninstall () {
return fieldValueIs<TransactDetailField> (SOFT_REMOVE);
}
bool setSoftInstall (bool flag) {
fieldValueAssign<TransactDetailField>(flag?SOFT_INSTALL:0);
return true;
}
bool setSoftUninstall (bool flag) {
fieldValueAssign<TransactDetailField>(flag?SOFT_REMOVE:0);
return true;
}
bool setUndetermined ()
{
fieldValueAssign<ValidateField>(UNDETERMINED);
return true;
}
bool setSatisfied ()
{
fieldValueAssign<ValidateField>(SATISFIED);
return true;
}
bool setBroken ()
{
fieldValueAssign<ValidateField>(BROKEN);
return true;
}
bool setNonRelevant ()
{
fieldValueAssign<ValidateField>(NONRELEVANT);
return true;
}
bool setStatus( ResStatus newStatus_r )
{
// State field is immutable!
if ( _bitfield.value<StateField>() != newStatus_r._bitfield.value<StateField>() )
return false;
// Transaction state change allowed?
if ( ! setTransactValue( newStatus_r.getTransactValue(), newStatus_r.getTransactByValue() ) )
return false;
// Ok, we take it all..
_bitfield = newStatus_r._bitfield;
return true;
}
/** \name Builtin ResStatus constants. */
//@{
static const ResStatus toBeInstalled;
static const ResStatus toBeUninstalled;
static const ResStatus toBeUninstalledDueToUpgrade;
static const ResStatus toBeUninstalledDueToObsolete;
//@}
private:
/** Ctor for intialization of builtin constants. */
ResStatus( StateValue s,
ValidateValue v = UNDETERMINED,
TransactValue t = KEEP_STATE,
InstallDetailValue i = EXPLICIT_INSTALL,
RemoveDetailValue r = EXPLICIT_REMOVE );
/** Return whether the corresponding Field has value \a val_r.
*/
template<class _Field>
bool fieldValueIs( FieldType val_r ) const
{ return _bitfield.isEqual<_Field>( val_r ); }
/** Set the corresponding Field to value \a val_r.
*/
template<class _Field>
void fieldValueAssign( FieldType val_r )
{ _bitfield.assign<_Field>( val_r ); }
/** compare two values.
*/
template<class _Field>
bool isGreaterThan( FieldType val_r )
{ return _bitfield.value<_Field>() > val_r; }
template<class _Field>
bool isLessThan( FieldType val_r )
{ return _bitfield.value<_Field>() < val_r; }
private:
friend class resstatus::StatusBackup;
BitFieldType _bitfield;
};
///////////////////////////////////////////////////////////////////
/** \relates ResStatus Stream output */
std::ostream & operator<<( std::ostream & str, const ResStatus & obj );
/** \relates ResStatus Stream output */
std::ostream & operator<<( std::ostream & str, ResStatus::TransactValue obj );
/** \relates ResStatus Stream output */
std::ostream & operator<<( std::ostream & str, ResStatus::TransactByValue obj );
/** \relates ResStatus */
inline bool operator==( const ResStatus & lhs, const ResStatus & rhs )
{ return lhs._bitfield == rhs._bitfield; }
/** \relates ResStatus */
inline bool operator!=( const ResStatus & lhs, const ResStatus & rhs )
{ return ! (lhs == rhs); }
///////////////////////////////////////////////////////////////////
namespace resstatus
{
class StatusBackup
{
public:
StatusBackup()
: _status( 0 )
{}
StatusBackup( ResStatus & status_r )
: _status( &status_r )
, _bitfield( _status->_bitfield )
{}
void replay()
{ if ( _status ) _status->_bitfield = _bitfield; }
private:
ResStatus * _status;
ResStatus::BitFieldType _bitfield;
};
}
/////////////////////////////////////////////////////////////////
} // namespace zypp
///////////////////////////////////////////////////////////////////
#endif // ZYPP_RESSTATUS_H
|