/usr/include/coin/IpSmartPtr.hpp is in coinor-libipopt-dev 3.11.9-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 738 739 740 741 742 743 744 | // Copyright (C) 2004, 2011 International Business Machines and others.
// All Rights Reserved.
// This code is published under the Eclipse Public License.
//
// $Id: IpSmartPtr.hpp 2182 2013-03-30 20:02:18Z stefan $
//
// Authors: Carl Laird, Andreas Waechter IBM 2004-08-13
#ifndef __IPSMARTPTR_HPP__
#define __IPSMARTPTR_HPP__
#ifdef HAVE_CSTDDEF
# include <cstddef>
#else
# ifdef HAVE_STDDEF_H
# include <stddef.h>
# else
# error "don't have header file for stddef"
# endif
#endif
#include "IpReferenced.hpp"
#include "IpDebug.hpp"
#if COIN_IPOPT_CHECKLEVEL > 2
# define IP_DEBUG_SMARTPTR
#endif
#ifndef IPOPT_UNUSED
# if defined(__GNUC__)
# define IPOPT_UNUSED __attribute__((unused))
# else
# define IPOPT_UNUSED
# endif
#endif
namespace Ipopt
{
/** Template class for Smart Pointers.
* A SmartPtr behaves much like a raw pointer, but manages the lifetime
* of an object, deleting the object automatically. This class implements
* a reference-counting, intrusive smart pointer design, where all
* objects pointed to must inherit off of ReferencedObject, which
* stores the reference count. Although this is intrusive (native types
* and externally authored classes require wrappers to be referenced
* by smart pointers), it is a safer design. A more detailed discussion of
* these issues follows after the usage information.
*
* Usage Example:
* Note: to use the SmartPtr, all objects to which you point MUST
* inherit off of ReferencedObject.
*
* \verbatim
*
* In MyClass.hpp...
*
* #include "IpReferenced.hpp"
* namespace Ipopt {
*
* class MyClass : public ReferencedObject // must derive from ReferencedObject
* {
* ...
* }
* } // namespace Ipopt
*
*
* In my_usage.cpp...
*
* #include "IpSmartPtr.hpp"
* #include "MyClass.hpp"
*
* void func(AnyObject& obj)
* {
* SmartPtr<MyClass> ptr_to_myclass = new MyClass(...);
* // ptr_to_myclass now points to a new MyClass,
* // and the reference count is 1
*
* ...
*
* obj.SetMyClass(ptr_to_myclass);
* // Here, let's assume that AnyObject uses a
* // SmartPtr<MyClass> internally here.
* // Now, both ptr_to_myclass and the internal
* // SmartPtr in obj point to the same MyClass object
* // and its reference count is 2.
*
* ...
*
* // No need to delete ptr_to_myclass, this
* // will be done automatically when the
* // reference count drops to zero.
*
* }
*
* \endverbatim
*
* It is not necessary to use SmartPtr's in all cases where an
* object is used that has been allocated "into" a SmartPtr. It is
* possible to just pass objects by reference or regular pointers,
* even if lower down in the stack a SmartPtr is to be held on to.
* Everything should work fine as long as a pointer created by "new"
* is immediately passed into a SmartPtr, and if SmartPtr's are used
* to hold on to objects.
*
* Other Notes:
* The SmartPtr implements both dereference operators -> & *.
* The SmartPtr does NOT implement a conversion operator to
* the raw pointer. Use the GetRawPtr() method when this
* is necessary. Make sure that the raw pointer is NOT
* deleted.
* The SmartPtr implements the comparison operators == & !=
* for a variety of types. Use these instead of
* \verbatim
* if (GetRawPtr(smrt_ptr) == ptr) // Don't use this
* \endverbatim
* SmartPtr's, as currently implemented, do NOT handle circular references.
* For example: consider a higher level object using SmartPtrs to point to
* A and B, but A and B also point to each other (i.e. A has a SmartPtr
* to B and B has a SmartPtr to A). In this scenario, when the higher
* level object is finished with A and B, their reference counts will
* never drop to zero (since they reference each other) and they
* will not be deleted. This can be detected by memory leak tools like
* valgrind. If the circular reference is necessary, the problem can be
* overcome by a number of techniques:
*
* 1) A and B can have a method that "releases" each other, that is
* they set their internal SmartPtrs to NULL.
* \verbatim
* void AClass::ReleaseCircularReferences()
* {
* smart_ptr_to_B = NULL;
* }
* \endverbatim
* Then, the higher level class can call these methods before
* it is done using A & B.
*
* 2) Raw pointers can be used in A and B to reference each other.
* Here, an implicit assumption is made that the lifetime is
* controlled by the higher level object and that A and B will
* both exist in a controlled manner. Although this seems
* dangerous, in many situations, this type of referencing
* is very controlled and this is reasonably safe.
*
* 3) This SmartPtr class could be redesigned with the Weak/Strong
* design concept. Here, the SmartPtr is identified as being
* Strong (controls lifetime of the object) or Weak (merely
* referencing the object). The Strong SmartPtr increments
* (and decrements) the reference count in ReferencedObject
* but the Weak SmartPtr does not. In the example above,
* the higher level object would have Strong SmartPtrs to
* A and B, but A and B would have Weak SmartPtrs to each
* other. Then, when the higher level object was done with
* A and B, they would be deleted. The Weak SmartPtrs in A
* and B would not decrement the reference count and would,
* of course, not delete the object. This idea is very similar
* to item (2), where it is implied that the sequence of events
* is controlled such that A and B will not call anything using
* their pointers following the higher level delete (i.e. in
* their destructors!). This is somehow safer, however, because
* code can be written (however expensive) to perform run-time
* detection of this situation. For example, the ReferencedObject
* could store pointers to all Weak SmartPtrs that are referencing
* it and, in its destructor, tell these pointers that it is
* dying. They could then set themselves to NULL, or set an
* internal flag to detect usage past this point.
*
* Comments on Non-Intrusive Design:
* In a non-intrusive design, the reference count is stored somewhere other
* than the object being referenced. This means, unless the reference
* counting pointer is the first referencer, it must get a pointer to the
* referenced object from another smart pointer (so it has access to the
* reference count location). In this non-intrusive design, if we are
* pointing to an object with a smart pointer (or a number of smart
* pointers), and we then give another smart pointer the address through
* a RAW pointer, we will have two independent, AND INCORRECT, reference
* counts. To avoid this pitfall, we use an intrusive reference counting
* technique where the reference count is stored in the object being
* referenced.
*/
template<class T>
class SmartPtr : public Referencer
{
public:
#define ipopt_dbg_smartptr_verbosity 0
/**@name Constructors/Destructors */
//@{
/** Default constructor, initialized to NULL */
SmartPtr();
/** Copy constructor, initialized from copy of type T */
SmartPtr(const SmartPtr<T>& copy);
/** Copy constructor, initialized from copy of type U */
template <class U>
SmartPtr(const SmartPtr<U>& copy);
/** Constructor, initialized from T* ptr */
SmartPtr(T* ptr);
/** Destructor, automatically decrements the
* reference count, deletes the object if
* necessary.*/
~SmartPtr();
//@}
/**@name Overloaded operators. */
//@{
/** Overloaded arrow operator, allows the user to call
* methods using the contained pointer. */
T* operator->() const;
/** Overloaded dereference operator, allows the user
* to dereference the contained pointer. */
T& operator*() const;
/** Overloaded equals operator, allows the user to
* set the value of the SmartPtr from a raw pointer */
SmartPtr<T>& operator=(T* rhs);
/** Overloaded equals operator, allows the user to
* set the value of the SmartPtr from another
* SmartPtr */
SmartPtr<T>& operator=(const SmartPtr<T>& rhs);
/** Overloaded equals operator, allows the user to
* set the value of the SmartPtr from another
* SmartPtr of a different type */
template <class U>
SmartPtr<T>& operator=(const SmartPtr<U>& rhs);
/** Overloaded equality comparison operator, allows the
* user to compare the value of two SmartPtrs */
template <class U1, class U2>
friend
bool operator==(const SmartPtr<U1>& lhs, const SmartPtr<U2>& rhs);
/** Overloaded equality comparison operator, allows the
* user to compare the value of a SmartPtr with a raw pointer. */
template <class U1, class U2>
friend
bool operator==(const SmartPtr<U1>& lhs, U2* raw_rhs);
/** Overloaded equality comparison operator, allows the
* user to compare the value of a raw pointer with a SmartPtr. */
template <class U1, class U2>
friend
bool operator==(U1* lhs, const SmartPtr<U2>& raw_rhs);
/** Overloaded in-equality comparison operator, allows the
* user to compare the value of two SmartPtrs */
template <class U1, class U2>
friend
bool operator!=(const SmartPtr<U1>& lhs, const SmartPtr<U2>& rhs);
/** Overloaded in-equality comparison operator, allows the
* user to compare the value of a SmartPtr with a raw pointer. */
template <class U1, class U2>
friend
bool operator!=(const SmartPtr<U1>& lhs, U2* raw_rhs);
/** Overloaded in-equality comparison operator, allows the
* user to compare the value of a SmartPtr with a raw pointer. */
template <class U1, class U2>
friend
bool operator!=(U1* lhs, const SmartPtr<U2>& raw_rhs);
/** Overloaded less-than comparison operator, allows the
* user to compare the value of two SmartPtrs */
template <class U>
friend
bool operator<(const SmartPtr<U>& lhs, const SmartPtr<U>& rhs);
//@}
/**@name friend method declarations. */
//@{
/** Returns the raw pointer contained.
* Use to get the value of
* the raw ptr (i.e. to pass to other
* methods/functions, etc.)
* Note: This method does NOT copy,
* therefore, modifications using this
* value modify the underlying object
* contained by the SmartPtr,
* NEVER delete this returned value.
*/
template <class U>
friend
U* GetRawPtr(const SmartPtr<U>& smart_ptr);
/** Returns a const pointer */
template <class U>
friend
SmartPtr<const U> ConstPtr(const SmartPtr<U>& smart_ptr);
/** Returns true if the SmartPtr is NOT NULL.
* Use this to check if the SmartPtr is not null
* This is preferred to if(GetRawPtr(sp) != NULL)
*/
template <class U>
friend
bool IsValid(const SmartPtr<U>& smart_ptr);
/** Returns true if the SmartPtr is NULL.
* Use this to check if the SmartPtr IsNull.
* This is preferred to if(GetRawPtr(sp) == NULL)
*/
template <class U>
friend
bool IsNull(const SmartPtr<U>& smart_ptr);
//@}
private:
/**@name Private Data/Methods */
//@{
/** Actual raw pointer to the object. */
T* ptr_;
/** Set the value of the internal raw pointer
* from another raw pointer, releasing the
* previously referenced object if necessary. */
SmartPtr<T>& SetFromRawPtr_(T* rhs);
/** Set the value of the internal raw pointer
* from a SmartPtr, releasing the previously referenced
* object if necessary. */
SmartPtr<T>& SetFromSmartPtr_(const SmartPtr<T>& rhs);
/** Release the currently referenced object. */
void ReleasePointer_();
//@}
};
/**@name SmartPtr friend function declarations.*/
//@{
template <class U>
U* GetRawPtr(const SmartPtr<U>& smart_ptr);
template <class U>
SmartPtr<const U> ConstPtr(const SmartPtr<U>& smart_ptr);
template <class U>
bool IsNull(const SmartPtr<U>& smart_ptr);
template <class U>
bool IsValid(const SmartPtr<U>& smart_ptr);
template <class U1, class U2>
bool operator==(const SmartPtr<U1>& lhs, const SmartPtr<U2>& rhs);
template <class U1, class U2>
bool operator==(const SmartPtr<U1>& lhs, U2* raw_rhs);
template <class U1, class U2>
bool operator==(U1* lhs, const SmartPtr<U2>& raw_rhs);
template <class U1, class U2>
bool operator!=(const SmartPtr<U1>& lhs, const SmartPtr<U2>& rhs);
template <class U1, class U2>
bool operator!=(const SmartPtr<U1>& lhs, U2* raw_rhs);
template <class U1, class U2>
bool operator!=(U1* lhs, const SmartPtr<U2>& raw_rhs);
//@}
template <class T>
SmartPtr<T>::SmartPtr()
:
ptr_(0)
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_METH("SmartPtr<T>::SmartPtr()", ipopt_dbg_smartptr_verbosity);
#endif
#ifndef NDEBUG
const ReferencedObject* IPOPT_UNUSED trying_to_use_SmartPtr_with_an_object_that_does_not_inherit_from_ReferencedObject_ = ptr_;
#endif
}
template <class T>
SmartPtr<T>::SmartPtr(const SmartPtr<T>& copy)
:
ptr_(0)
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_METH("SmartPtr<T>::SmartPtr(const SmartPtr<T>& copy)", ipopt_dbg_smartptr_verbosity);
#endif
#ifndef NDEBUG
const ReferencedObject* IPOPT_UNUSED trying_to_use_SmartPtr_with_an_object_that_does_not_inherit_from_ReferencedObject_ = ptr_;
#endif
(void) SetFromSmartPtr_(copy);
}
template <class T>
template <class U>
SmartPtr<T>::SmartPtr(const SmartPtr<U>& copy)
:
ptr_(0)
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_METH("SmartPtr<T>::SmartPtr(const SmartPtr<U>& copy)", ipopt_dbg_smartptr_verbosity);
#endif
#ifndef NDEBUG
const ReferencedObject* IPOPT_UNUSED trying_to_use_SmartPtr_with_an_object_that_does_not_inherit_from_ReferencedObject_ = ptr_;
#endif
(void) SetFromSmartPtr_(GetRawPtr(copy));
}
template <class T>
SmartPtr<T>::SmartPtr(T* ptr)
:
ptr_(0)
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_METH("SmartPtr<T>::SmartPtr(T* ptr)", ipopt_dbg_smartptr_verbosity);
#endif
#ifndef NDEBUG
const ReferencedObject* IPOPT_UNUSED trying_to_use_SmartPtr_with_an_object_that_does_not_inherit_from_ReferencedObject_ = ptr_;
#endif
(void) SetFromRawPtr_(ptr);
}
template <class T>
SmartPtr<T>::~SmartPtr()
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_METH("SmartPtr<T>::~SmartPtr(T* ptr)", ipopt_dbg_smartptr_verbosity);
#endif
ReleasePointer_();
}
template <class T>
T* SmartPtr<T>::operator->() const
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_METH("T* SmartPtr<T>::operator->()", ipopt_dbg_smartptr_verbosity);
#endif
// cannot deref a null pointer
#if COIN_IPOPT_CHECKLEVEL > 0
assert(ptr_);
#endif
return ptr_;
}
template <class T>
T& SmartPtr<T>::operator*() const
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_METH("T& SmartPtr<T>::operator*()", ipopt_dbg_smartptr_verbosity);
#endif
// cannot dereference a null pointer
#if COIN_IPOPT_CHECKLEVEL > 0
assert(ptr_);
#endif
return *ptr_;
}
template <class T>
SmartPtr<T>& SmartPtr<T>::operator=(T* rhs)
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_METH("SmartPtr<T>& SmartPtr<T>::operator=(T* rhs)", ipopt_dbg_smartptr_verbosity);
#endif
return SetFromRawPtr_(rhs);
}
template <class T>
SmartPtr<T>& SmartPtr<T>::operator=(const SmartPtr<T>& rhs)
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_METH(
"SmartPtr<T>& SmartPtr<T>::operator=(const SmartPtr<T>& rhs)",
ipopt_dbg_smartptr_verbosity);
#endif
return SetFromSmartPtr_(rhs);
}
template <class T>
template <class U>
SmartPtr<T>& SmartPtr<T>::operator=(const SmartPtr<U>& rhs)
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_METH(
"SmartPtr<T>& SmartPtr<T>::operator=(const SmartPtr<U>& rhs)",
ipopt_dbg_smartptr_verbosity);
#endif
return SetFromSmartPtr_(GetRawPtr(rhs));
}
template <class T>
SmartPtr<T>& SmartPtr<T>::SetFromRawPtr_(T* rhs)
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_METH(
"SmartPtr<T>& SmartPtr<T>::SetFromRawPtr_(T* rhs)", ipopt_dbg_smartptr_verbosity);
#endif
if (rhs != 0)
rhs->AddRef(this);
// Release any old pointer
ReleasePointer_();
ptr_ = rhs;
return *this;
}
template <class T>
SmartPtr<T>& SmartPtr<T>::SetFromSmartPtr_(const SmartPtr<T>& rhs)
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_METH(
"SmartPtr<T>& SmartPtr<T>::SetFromSmartPtr_(const SmartPtr<T>& rhs)",
ipopt_dbg_smartptr_verbosity);
#endif
SetFromRawPtr_(GetRawPtr(rhs));
return (*this);
}
template <class T>
void SmartPtr<T>::ReleasePointer_()
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_METH(
"void SmartPtr<T>::ReleasePointer()",
ipopt_dbg_smartptr_verbosity);
#endif
if (ptr_) {
ptr_->ReleaseRef(this);
if (ptr_->ReferenceCount() == 0)
delete ptr_;
}
}
template <class U>
U* GetRawPtr(const SmartPtr<U>& smart_ptr)
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_FUN(
"T* GetRawPtr(const SmartPtr<T>& smart_ptr)",
0);
#endif
return smart_ptr.ptr_;
}
template <class U>
SmartPtr<const U> ConstPtr(const SmartPtr<U>& smart_ptr)
{
// compiler should implicitly cast
return GetRawPtr(smart_ptr);
}
template <class U>
bool IsValid(const SmartPtr<U>& smart_ptr)
{
return !IsNull(smart_ptr);
}
template <class U>
bool IsNull(const SmartPtr<U>& smart_ptr)
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_FUN(
"bool IsNull(const SmartPtr<T>& smart_ptr)",
0);
#endif
return (smart_ptr.ptr_ == 0);
}
template <class U1, class U2>
bool ComparePointers(const U1* lhs, const U2* rhs)
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_FUN(
"bool ComparePtrs(const U1* lhs, const U2* rhs)",
ipopt_dbg_smartptr_verbosity);
#endif
// Even if lhs and rhs point to the same object
// with different interfaces U1 and U2, we cannot guarantee that
// the value of the pointers will be equivalent. We can
// guarantee this if we convert to ReferencedObject* (see also #162)
const ReferencedObject* v_lhs = lhs;
const ReferencedObject* v_rhs = rhs;
return v_lhs == v_rhs;
}
template <class U1, class U2>
bool operator==(const SmartPtr<U1>& lhs, const SmartPtr<U2>& rhs)
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_FUN(
"bool operator==(const SmartPtr<U1>& lhs, const SmartPtr<U2>& rhs)",
ipopt_dbg_smartptr_verbosity);
#endif
U1* raw_lhs = GetRawPtr(lhs);
U2* raw_rhs = GetRawPtr(rhs);
return ComparePointers(raw_lhs, raw_rhs);
}
template <class U1, class U2>
bool operator==(const SmartPtr<U1>& lhs, U2* raw_rhs)
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_FUN(
"bool operator==(SmartPtr<U1>& lhs, U2* rhs)",
ipopt_dbg_smartptr_verbosity);
#endif
U1* raw_lhs = GetRawPtr(lhs);
return ComparePointers(raw_lhs, raw_rhs);
}
template <class U1, class U2>
bool operator==(U1* raw_lhs, const SmartPtr<U2>& rhs)
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_FUN(
"bool operator==(U1* raw_lhs, SmartPtr<U2>& rhs)",
ipopt_dbg_smartptr_verbosity);
#endif
const U2* raw_rhs = GetRawPtr(rhs);
return ComparePointers(raw_lhs, raw_rhs);
}
template <class U1, class U2>
bool operator!=(const SmartPtr<U1>& lhs, const SmartPtr<U2>& rhs)
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_FUN(
"bool operator!=(const SmartPtr<U1>& lhs, const SmartPtr<U2>& rhs)",
ipopt_dbg_smartptr_verbosity);
#endif
bool retValue = operator==(lhs, rhs);
return !retValue;
}
template <class U1, class U2>
bool operator!=(const SmartPtr<U1>& lhs, U2* raw_rhs)
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_FUN(
"bool operator!=(SmartPtr<U1>& lhs, U2* rhs)",
ipopt_dbg_smartptr_verbosity);
#endif
bool retValue = operator==(lhs, raw_rhs);
return !retValue;
}
template <class U1, class U2>
bool operator!=(U1* raw_lhs, const SmartPtr<U2>& rhs)
{
#ifdef IP_DEBUG_SMARTPTR
DBG_START_FUN(
"bool operator!=(U1* raw_lhs, SmartPtr<U2>& rhs)",
ipopt_dbg_smartptr_verbosity);
#endif
bool retValue = operator==(raw_lhs, rhs);
return !retValue;
}
template <class T>
void swap(SmartPtr<T>& a, SmartPtr<T>& b)
{
#ifdef IP_DEBUG_REFERENCED
SmartPtr<T> tmp(a);
a = b;
b = tmp;
#else
std::swap(a.prt_, b.ptr_);
#endif
}
template <class T>
bool operator<(const SmartPtr<T>& lhs, const SmartPtr<T>& rhs)
{
return lhs.ptr_ < rhs.ptr_;
}
template <class T>
bool operator> (const SmartPtr<T>& lhs, const SmartPtr<T>& rhs)
{
return rhs < lhs;
}
template <class T> bool
operator<=(const SmartPtr<T>& lhs, const SmartPtr<T>& rhs)
{
return !( rhs < lhs );
}
template <class T> bool
operator>=(const SmartPtr<T>& lhs, const SmartPtr<T>& rhs)
{
return !( lhs < rhs );
}
} // namespace Ipopt
#undef ipopt_dbg_smartptr_verbosity
#endif
|