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
|
/***
*cenumpt.cpp
*
* Copyright (C) 1992-1994, Microsoft Corporation. All Rights Reserved.
*
*Purpose:
* This module implements the CEnumPoint class.
*
*
*Implementation Notes:
*
*****************************************************************************/
#include "hostenv.h"
#include "cenumpt.h"
CEnumPoint::CEnumPoint()
{
m_refs = 0;
m_psa = NULL;
m_celts = 0;
m_iCurrent = 0;
}
/***
*HRESULT CEnumPoint::Create(SAFEARRAY*, CEnumPoint**)
*Purpose:
* This routine creates a CPoint enumerator from the given
* (1 X N) SafeArray of CPoint IDispatch pointers.
*
*Entry:
* psa = pointer to a SafeArray of VARIANTs
*
*Exit:
* return value = HRESULT
*
* *ppenum = pointer to a CPoint enumerator
*
***********************************************************************/
HRESULT
CEnumPoint::Create(SAFEARRAY FAR* psa, CEnumPoint FAR* FAR* ppenum)
{
long lBound;
HRESULT hresult;
CEnumPoint FAR* penum;
// Verify that the SafeArray is the proper shape.
//
if(SafeArrayGetDim(psa) != 1)
return ResultFromScode(E_INVALIDARG);
hresult = SafeArrayGetLBound(psa, 1, &lBound);
if(FAILED(hresult))
return hresult;
if(lBound != 0)
return ResultFromScode(E_INVALIDARG);
penum = new FAR CEnumPoint();
if(penum == NULL)
return ResultFromScode(E_OUTOFMEMORY);
penum->AddRef();
hresult = SafeArrayGetUBound(psa, 1, &lBound);
if(FAILED(hresult))
goto LError0;
penum->m_psa = psa;
penum->m_celts = lBound + 1;
*ppenum = penum;
return NOERROR;
LError0:;
penum->Release();
return hresult;
}
//---------------------------------------------------------------------
// IUnknown methods
//---------------------------------------------------------------------
STDMETHODIMP
CEnumPoint::QueryInterface(REFIID riid, void FAR* FAR* ppv)
{
if(!IsEqualIID(riid, IID_IUnknown))
if(!IsEqualIID(riid, IID_IEnumVARIANT)) {
*ppv = NULL;
return ResultFromScode(E_NOINTERFACE);
}
*ppv = this;
AddRef();
return NOERROR;
}
STDMETHODIMP_(unsigned long)
CEnumPoint::AddRef()
{
return ++m_refs;
}
STDMETHODIMP_(unsigned long)
CEnumPoint::Release()
{
if(--m_refs == 0){
if(m_psa != NULL)
SafeArrayDestroy(m_psa);
delete this;
return 0;
}
return m_refs;
}
//---------------------------------------------------------------------
// IEnumVARIANT methods
//---------------------------------------------------------------------
/***
*HRESULT CEnumPoint::Next(unsigned long, VARIANT*, unsigned long*)
*Purpose:
* Attempt to get the next 'celt' items in the enumeration sequence.
*
*Entry:
* celt = the number of elements to get
*
*Exit:
* return value = HRESULT
* S_OK
* S_FALSE - the end of the sequence was reached
*
* rgvar = array of the next 'celt' items
* *pceltFetched = count of the elements actually fetched.
*
***********************************************************************/
STDMETHODIMP
CEnumPoint::Next(
unsigned long celt,
VARIANT FAR* rgvar,
unsigned long FAR* pceltFetched)
{
long ix;
unsigned int i;
HRESULT hresult;
for(i = 0; i < celt; ++i)
VariantInit(&rgvar[i]);
for(i = 0; i < celt; ++i){
if(m_iCurrent == m_celts){
hresult = ResultFromScode(S_FALSE);
goto LDone;
}
ix = m_iCurrent++;
hresult = SafeArrayGetElement(m_psa, &ix, &rgvar[i]);
if(FAILED(hresult))
goto LError0;
}
hresult = NOERROR;
LDone:;
if (pceltFetched != NULL)
*pceltFetched = i;
return hresult;
LError0:;
for(i = 0; i < celt; ++i)
VariantClear(&rgvar[i]);
return hresult;
}
/***
*HRESULT CEnumPoint::Skip(unsigned long)
*Purpose:
* Attempt to skip over the next 'celt' elements in the enumeration
* sequence.
*
*Entry:
* celt = the count of elements to skip
*
*Exit:
* return value = HRESULT
* S_OK
* S_FALSE - the end of the sequence was reached
*
***********************************************************************/
STDMETHODIMP
CEnumPoint::Skip(unsigned long celt)
{
m_iCurrent += celt;
if(m_iCurrent > m_celts)
m_iCurrent = m_celts;
return (m_iCurrent == m_celts)
? ResultFromScode(S_FALSE) : NOERROR;
}
/***
*HRESULT CEnumPoint::Reset(void)
*Purpose:
* Reset the enumeration sequence back to the beginning.
*
*Entry:
* None
*
*Exit:
* return value = SHRESULT CODE
* S_OK
*
***********************************************************************/
STDMETHODIMP
CEnumPoint::Reset()
{
m_iCurrent = 0;
return NOERROR;
}
/***
*HRESULT CEnumPoint::Clone(IEnumVARIANT**)
*Purpose:
* Retrun a CPoint enumerator with exactly the same state as the
* current one.
*
*Entry:
* None
*
*Exit:
* return value = HRESULT
* S_OK
* E_OUTOFMEMORY
*
***********************************************************************/
STDMETHODIMP
CEnumPoint::Clone(IEnumVARIANT FAR* FAR* ppenum)
{
HRESULT hresult;
SAFEARRAY FAR* psa;
CEnumPoint FAR* penum;
hresult = SafeArrayCopy(m_psa, &psa);
if(FAILED(hresult))
return hresult;
hresult = CEnumPoint::Create(psa, &penum);
if(FAILED(hresult))
goto LError0;
// Assert(penum->m_celts == m_celts);
penum->m_iCurrent = m_iCurrent;
*ppenum = penum;
return NOERROR;
LError0:
SafeArrayDestroy(psa);
return hresult;
}
|
