Leaked source code of windows server 2003
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 

172 lines
4.5 KiB

/*++
Copyright (c) 1999 Microsoft Corporation
Module Name:
Enum.hxx
Abstract:
Declaration of VSS_OBJECT_PROP_Array
Adi Oltean [aoltean] 08/31/1999
Revision History:
Name Date Comments
aoltean 08/31/1999 Created
aoltean 09/09/1999 dss -> vss
aoltean 09/13/1999 VSS_OBJECT_PROP_Copy moved into inc\Copy.hxx
aoltean 09/20/1999 VSS_OBJECT_PROP_Copy renamed as VSS_OBJECT_PROP_Manager
aoltean 09/21/1999 Renaming back VSS_OBJECT_PROP_Manager to VSS_OBJECT_PROP_Copy.
Adding VSS_OBJECT_PROP_Ptr as a pointer to the properties structure.
This pointer will serve as element in CSimpleArray constructs.
Moving into basestor\vss\inc folder
--*/
#ifndef __VSS_ENUM_COORD_HXX__
#define __VSS_ENUM_COORD_HXX__
#if _MSC_VER > 1000
#pragma once
#endif
////////////////////////////////////////////////////////////////////////
// Standard foo for file name aliasing. This code block must be after
// all includes of VSS header files.
//
#ifdef VSS_FILE_ALIAS
#undef VSS_FILE_ALIAS
#endif
#define VSS_FILE_ALIAS "INCENUMH"
//
////////////////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////////////////////////////
// VSS_OBJECT_PROP_Array
class VSS_OBJECT_PROP_Array:
public CSimpleArray <VSS_OBJECT_PROP_Ptr>,
public IUnknown
{
// Typedefs
public:
class iterator
{
public:
iterator(): m_nIndex(0), m_pArr(NULL) {};
iterator(VSS_OBJECT_PROP_Array* pArr, int nIndex = 0)
: m_nIndex(nIndex), m_pArr(pArr)
{
BS_ASSERT(m_pArr->GetSize() >= m_nIndex); // Equality only when pointing to the "end"
BS_ASSERT(m_pArr);
};
iterator(const iterator& it): // To support postfix ++
m_nIndex(it.m_nIndex), m_pArr(it.m_pArr)
{
BS_ASSERT(m_pArr->GetSize() >= m_nIndex); // Equality only when pointing to the "end"
BS_ASSERT(m_pArr);
};
iterator& operator = (const iterator& rhs) {
m_nIndex = rhs.m_nIndex;
m_pArr = rhs.m_pArr;
BS_ASSERT(m_pArr);
BS_ASSERT(m_pArr->GetSize() >= m_nIndex); // Equality only when pointing to the "end"
return (*this);
};
bool operator != (const iterator& rhs) {
BS_ASSERT(m_pArr);
BS_ASSERT(m_pArr == rhs.m_pArr); // Impossible to be reached by the ATL code
return (m_nIndex != rhs.m_nIndex);
};
VSS_OBJECT_PROP& operator * () {
BS_ASSERT(m_pArr);
BS_ASSERT(m_nIndex <= m_pArr->GetSize());
VSS_OBJECT_PROP_Ptr& ptr = (*m_pArr)[m_nIndex];
VSS_OBJECT_PROP* pStruct = ptr.GetStruct();
BS_ASSERT(pStruct);
return *pStruct;
};
iterator operator ++ (int) { // Postfix ++
BS_ASSERT(m_pArr);
BS_ASSERT(m_nIndex < m_pArr->GetSize());
m_nIndex++;
return (*this);
};
private:
int m_nIndex;
VSS_OBJECT_PROP_Array* m_pArr;
};
// Constructors& destructors
private:
VSS_OBJECT_PROP_Array(const VSS_OBJECT_PROP_Array&);
public:
VSS_OBJECT_PROP_Array(): m_lRef(0) {};
// Operations
public:
iterator begin() {
return iterator(this, 0);
}
iterator end() {
return iterator(this, GetSize());
}
// Ovverides
public:
STDMETHOD(QueryInterface)(REFIID iid, void** pp)
{
if (pp == NULL)
return E_INVALIDARG;
if (iid != IID_IUnknown)
return E_NOINTERFACE;
AddRef();
IUnknown** pUnk = reinterpret_cast<IUnknown**>(pp);
(*pUnk) = static_cast<IUnknown*>(this);
return S_OK;
};
STDMETHOD_(ULONG, AddRef)()
{
return ::InterlockedIncrement(&m_lRef);
};
STDMETHOD_(ULONG, Release)()
{
LONG l = ::InterlockedDecrement(&m_lRef);
if (l == 0)
delete this; // We suppose that we always allocate this object on the heap!
return l;
};
// Implementation
public:
LONG m_lRef;
};
/////////////////////////////////////////////////////////////////////////////
// CVssEnumFromArray
typedef CComEnumOnSTL< IVssEnumObject, &IID_IVssEnumObject, VSS_OBJECT_PROP,
VSS_OBJECT_PROP_Copy, VSS_OBJECT_PROP_Array >
CVssEnumFromArray;
#endif // __VSS_ENUM_COORD_HXX__