CArraySelfDestroyPointer Class

# CArraySelfDestroyPointer Class Reference

[CADIHash.h Index] [CADIHash.h Hierarchy]

A template algorithm:find by binary search the closest element in a vector to a given element More...

`#include <../GIFTServer/CArraySelfDestroyPointer.h>`

## Public Members

- void resetWithoutDeleting ()
- inline bool isSelfDestroyer ()
- inline void setIsSelfDestroyer (bool inisSelfDestroyer=true)
- void unsetIsSelfDestroyer ()
- T* operator= (T* inPointer)
- T& operator* ()
- T const& operator* ()
- T* operator -> ()
- T const* operator -> ()
- ~CArraySelfDestroyPointer ()
- CArraySelfDestroyPointer (T*, bool = true)
- CArraySelfDestroyPointer (const CArraySelfDestroyPointer<T>& inSelfDestroyPointer)
- CArraySelfDestroyPointer ()
- operator bool ()
- operator T* ()

## Protected Members

- T* mPointer

## Detailed Description

A template algorithm:find by binary search the closest element in a vector to a given element.

@author: Wolfgang Müller

| Kdoc