📄 ienumunk.cpp
字号:
/*
* IENUMUNK.CPP
*
* Standard implementation of an IUnknown enumerator with the
* IEnumUnknown interface that will generally not need
* modification.
*
* Copyright (c)1993-1995 Microsoft Corporation, All Rights Reserved
*
* Kraig Brockschmidt, Microsoft
* Internet : kraigb@microsoft.com
* Compuserve: >INTERNET:kraigb@microsoft.com
*/
#include "ienumunk.h"
/*
* CEnumUnknown::CEnumUnknown
* CEnumUnknown::~CEnumUnknown
*
* Parameters (Constructor):
* pUnkRef LPUNKNOWN to use for reference counting.
* cUnk ULONG number of LPUNKNOWNs in prgUnk
* prgUnk LPUNKNOWN * to the array to enumerate.
*/
CEnumUnknown::CEnumUnknown(LPUNKNOWN pUnkRef, ULONG cUnk
, LPUNKNOWN *prgUnk)
{
UINT i;
m_cRef=0;
m_pUnkRef=pUnkRef;
m_iCur=0;
m_cUnk=cUnk;
m_prgUnk=new LPUNKNOWN[(UINT)cUnk];
if (NULL!=m_prgUnk)
{
for (i=0; i < cUnk; i++)
m_prgUnk[i]=prgUnk[i];
}
return;
}
CEnumUnknown::~CEnumUnknown(void)
{
if (NULL!=m_prgUnk)
delete [] m_prgUnk;
return;
}
/*
* CEnumUnknown::QueryInterface
* CEnumUnknown::AddRef
* CEnumUnknown::Release
*
* Purpose:
* IUnknown members for CEnumUnknown object.
*/
STDMETHODIMP CEnumUnknown::QueryInterface(REFIID riid
, LPVOID *ppv)
{
*ppv=NULL;
/*
* Enumerators are separate objects with their own
* QueryInterface behavior.
*/
if (IID_IUnknown==riid || IID_IEnumUnknown==riid)
*ppv=(LPVOID)this;
if (NULL!=*ppv)
{
((LPUNKNOWN)*ppv)->AddRef();
return NOERROR;
}
return ResultFromScode(E_NOINTERFACE);
}
STDMETHODIMP_(ULONG) CEnumUnknown::AddRef(void)
{
++m_cRef;
m_pUnkRef->AddRef();
return m_cRef;
}
STDMETHODIMP_(ULONG) CEnumUnknown::Release(void)
{
m_pUnkRef->Release();
if (0L!=--m_cRef)
return m_cRef;
delete this;
return 0;
}
/*
* CEnumUnknown::Next
*
* Purpose:
* Returns the next element in the enumeration.
*
* Parameters:
* cUnk ULONG number of LPUNKNOWNs to return.
* ppUnk LPUNKNOWN * in which to store the returned
* pointer.
* pulUnk ULONG * in which to return how many we
* enumerated.
*
* Return Value:
* HRESULT NOERROR if successful, S_FALSE otherwise,
*/
STDMETHODIMP CEnumUnknown::Next(ULONG cUnk, LPUNKNOWN *ppUnk
, ULONG *pulUnk)
{
ULONG cReturn=0L;
if (NULL==m_prgUnk)
return ResultFromScode(S_FALSE);
if (NULL==pulUnk)
{
if (1L!=cUnk)
return ResultFromScode(E_POINTER);
}
else
*pulUnk=0L;
if (NULL==ppUnk || m_iCur >= m_cUnk)
return ResultFromScode(S_FALSE);
while (m_iCur < m_cUnk && cUnk > 0)
{
*ppUnk=m_prgUnk[m_iCur++];
if (NULL!=*ppUnk)
(*ppUnk)->AddRef();
ppUnk++;
cReturn++;
cUnk--;
}
if (NULL!=pulUnk)
*pulUnk=cReturn;
return NOERROR;
}
/*
* CEnumUnknown::Skip
*
* Purpose:
* Skips the next n elements in the enumeration.
*
* Parameters:
* cSkip ULONG number of elements to skip.
*
* Return Value:
* HRESULT NOERROR if successful, S_FALSE if we could not
* skip the requested number.
*/
STDMETHODIMP CEnumUnknown::Skip(ULONG cSkip)
{
if (((m_iCur+cSkip) >= m_cUnk) || NULL==m_prgUnk)
return ResultFromScode(S_FALSE);
m_iCur+=cSkip;
return NOERROR;
}
/*
* CEnumUnknown::Reset
*
* Purpose:
* Resets the current element index in the enumeration to zero.
*
* Parameters:
* None
*/
STDMETHODIMP CEnumUnknown::Reset(void)
{
m_iCur=0;
return NOERROR;
}
/*
* CEnumUnknown::Clone
*
* Purpose:
* Returns another IEnumUnknown with the same state as ourselves.
*
* Parameters:
* ppEnum LPENUMUNKNOWN * in which to return the
* new object.
*/
STDMETHODIMP CEnumUnknown::Clone(LPENUMUNKNOWN *ppEnum)
{
PCEnumUnknown pNew;
*ppEnum=NULL;
//Create the clone
pNew=new CEnumUnknown(m_pUnkRef, m_cUnk, m_prgUnk);
if (NULL==pNew)
return ResultFromScode(E_OUTOFMEMORY);
pNew->AddRef();
pNew->m_iCur=m_iCur;
*ppEnum=pNew;
return NOERROR;
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -