-
Notifications
You must be signed in to change notification settings - Fork 271
Expand file tree
/
Copy pathbase_array.h
More file actions
582 lines (478 loc) · 17.4 KB
/
base_array.h
File metadata and controls
582 lines (478 loc) · 17.4 KB
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
WINRT_EXPORT namespace winrt
{
template <typename T>
struct array_view
{
using value_type = T;
using size_type = uint32_t;
using reference = value_type&;
using const_reference = value_type const&;
using pointer = value_type*;
using const_pointer = value_type const*;
using iterator = value_type*;
using const_iterator = value_type const*;
using reverse_iterator = std::reverse_iterator<iterator>;
using const_reverse_iterator = std::reverse_iterator<const_iterator>;
array_view() noexcept = default;
array_view(pointer data, size_type size) noexcept :
m_data(data),
m_size(size)
{}
array_view(pointer first, pointer last) noexcept :
m_data(first),
m_size(static_cast<size_type>(last - first))
{}
array_view(std::initializer_list<value_type> value) noexcept :
array_view(value.begin(), static_cast<size_type>(value.size()))
{}
#ifdef __cpp_lib_span
template <typename C, size_t extent>
array_view(std::span<C, extent> span) noexcept :
array_view(span.data(), static_cast<size_type>(span.size()))
{
WINRT_ASSERT(span.size() <= UINT_MAX);
}
operator std::span<T>() const noexcept
{
return { m_data, m_size };
}
#endif
template <typename C, size_type N>
array_view(C(&value)[N]) noexcept :
array_view(value, N)
{}
template <typename C>
array_view(std::vector<C>& value) noexcept :
array_view(data(value), static_cast<size_type>(value.size()))
{
}
template <typename C>
array_view(std::vector<C> const& value) noexcept :
array_view(data(value), static_cast<size_type>(value.size()))
{
}
template <typename C, size_t N>
array_view(std::array<C, N>& value) noexcept :
array_view(value.data(), static_cast<size_type>(value.size()))
{}
template <typename C, size_t N>
array_view(std::array<C, N> const& value) noexcept :
array_view(value.data(), static_cast<size_type>(value.size()))
{}
template <typename OtherType>
array_view(array_view<OtherType> const& other,
std::enable_if_t<std::is_convertible_v<OtherType(*)[], T(*)[]>, int> = 0) noexcept :
array_view(other.data(), other.size())
{}
reference operator[](size_type const pos) noexcept
{
WINRT_ASSERT(pos < size());
return m_data[pos];
}
const_reference operator[](size_type const pos) const noexcept
{
WINRT_ASSERT(pos < size());
return m_data[pos];
}
reference at(size_type const pos)
{
if (size() <= pos)
{
throw std::out_of_range("Invalid array subscript");
}
return m_data[pos];
}
const_reference at(size_type const pos) const
{
if (size() <= pos)
{
throw std::out_of_range("Invalid array subscript");
}
return m_data[pos];
}
reference front() noexcept
{
WINRT_ASSERT(m_size > 0);
return*m_data;
}
const_reference front() const noexcept
{
WINRT_ASSERT(m_size > 0);
return*m_data;
}
reference back() noexcept
{
WINRT_ASSERT(m_size > 0);
return m_data[m_size - 1];
}
const_reference back() const noexcept
{
WINRT_ASSERT(m_size > 0);
return m_data[m_size - 1];
}
pointer data() const noexcept
{
return m_data;
}
iterator begin() noexcept
{
return m_data;
}
const_iterator begin() const noexcept
{
return m_data;
}
const_iterator cbegin() const noexcept
{
return m_data;
}
iterator end() noexcept
{
return m_data + m_size;
}
const_iterator end() const noexcept
{
return m_data + m_size;
}
const_iterator cend() const noexcept
{
return m_data + m_size;
}
reverse_iterator rbegin() noexcept
{
return reverse_iterator(end());
}
const_reverse_iterator rbegin() const noexcept
{
return const_reverse_iterator(end());
}
const_reverse_iterator crbegin() const noexcept
{
return rbegin();
}
reverse_iterator rend() noexcept
{
return reverse_iterator(begin());
}
const_reverse_iterator rend() const noexcept
{
return const_reverse_iterator(begin());
}
const_reverse_iterator crend() const noexcept
{
return rend();
}
bool empty() const noexcept
{
return m_size == 0;
}
size_type size() const noexcept
{
return m_size;
}
protected:
pointer m_data{ nullptr };
size_type m_size{ 0 };
private:
template <typename C>
auto data(std::vector<C> const& value) noexcept
{
static_assert(!std::is_same_v<C, bool>, "Cannot use std::vector<bool> as an array_view. Consider std::array or std::unique_ptr<bool[]>.");
return value.data();
}
template <typename C>
auto data(std::vector<C>& value) noexcept
{
static_assert(!std::is_same_v<C, bool>, "Cannot use std::vector<bool> as an array_view. Consider std::array or std::unique_ptr<bool[]>.");
return value.data();
}
};
template <typename C, size_t N> array_view(C(&value)[N]) -> array_view<C>;
template <typename C> array_view(std::vector<C>& value) -> array_view<C>;
template <typename C> array_view(std::vector<C> const& value) -> array_view<C const>;
template <typename C, size_t N> array_view(std::array<C, N>& value) -> array_view<C>;
template <typename C, size_t N> array_view(std::array<C, N> const& value) -> array_view<C const>;
#ifdef __cpp_lib_span
template <typename C, size_t extent> array_view(std::span<C, extent>& value) -> array_view<C>;
template <typename C, size_t extent> array_view(std::span<C, extent> const& value) -> array_view<C const>;
#endif
template <typename T>
struct com_array : array_view<T>
{
using typename array_view<T>::value_type;
using typename array_view<T>::size_type;
using typename array_view<T>::reference;
using typename array_view<T>::const_reference;
using typename array_view<T>::pointer;
using typename array_view<T>::const_pointer;
using typename array_view<T>::iterator;
using typename array_view<T>::const_iterator;
using typename array_view<T>::reverse_iterator;
using typename array_view<T>::const_reverse_iterator;
com_array(com_array const&) = delete;
com_array& operator=(com_array const&) = delete;
com_array() noexcept = default;
explicit com_array(size_type const count) :
com_array(count, value_type())
{}
com_array(void* ptr, uint32_t const count, take_ownership_from_abi_t) noexcept :
array_view<T>(static_cast<value_type*>(ptr), static_cast<value_type*>(ptr) + count)
{
}
com_array(size_type const count, value_type const& value)
{
alloc(count);
std::uninitialized_fill_n(this->m_data, count, value);
}
template <typename InIt, typename = std::void_t<typename std::iterator_traits<InIt>::difference_type>>
com_array(InIt first, InIt last)
{
alloc(static_cast<size_type>(std::distance(first, last)));
std::uninitialized_copy(first, last, this->begin());
}
template <typename U>
explicit com_array(std::vector<U> const& value) :
com_array(value.begin(), value.end())
{}
template <typename U, size_t N>
explicit com_array(std::array<U, N> const& value) :
com_array(value.begin(), value.end())
{}
#ifdef __cpp_lib_span
template <typename U, size_t extent>
explicit com_array(std::span<U, extent> span) noexcept :
com_array(span.data(), span.data() + span.size())
{
WINRT_ASSERT(span.size() <= UINT_MAX);
}
#endif
template <typename U, size_t N>
explicit com_array(U const(&value)[N]) :
com_array(value, value + N)
{}
com_array(std::initializer_list<value_type> value) :
com_array(value.begin(), value.end())
{}
template <typename U, typename = std::enable_if_t<std::is_convertible_v<U, T>>>
com_array(std::initializer_list<U> value) :
com_array(value.begin(), value.end())
{}
com_array(com_array&& other) noexcept :
array_view<T>(other.m_data, other.m_size)
{
other.m_data = nullptr;
other.m_size = 0;
}
com_array& operator=(com_array&& other) noexcept
{
clear();
this->m_data = other.m_data;
this->m_size = other.m_size;
other.m_data = nullptr;
other.m_size = 0;
return*this;
}
~com_array() noexcept
{
clear();
}
void clear() noexcept
{
if (this->m_data == nullptr) { return; }
std::destroy(this->begin(), this->end());
WINRT_IMPL_CoTaskMemFree(this->m_data);
this->m_data = nullptr;
this->m_size = 0;
}
friend void swap(com_array& left, com_array& right) noexcept
{
std::swap(left.m_data, right.m_data);
std::swap(left.m_size, right.m_size);
}
private:
void alloc(size_type const size)
{
WINRT_ASSERT(this->empty());
if (0 != size)
{
this->m_data = static_cast<value_type*>(WINRT_IMPL_CoTaskMemAlloc(size * sizeof(value_type)));
if (this->m_data == nullptr)
{
throw std::bad_alloc();
}
this->m_size = size;
}
}
std::pair<uint32_t, impl::arg_out<T>> detach_abi() noexcept
{
#ifdef _MSC_VER
// https://github.com/microsoft/cppwinrt/pull/1165
std::pair<uint32_t, impl::arg_out<T>> result;
memset(&result, 0, sizeof(result));
result.first = this->size();
result.second = *reinterpret_cast<impl::arg_out<T>*>(this);
memset(this, 0, sizeof(com_array<T>));
#else
std::pair<uint32_t, impl::arg_out<T>> result(this->size(), *reinterpret_cast<impl::arg_out<T>*>(this));
this->m_data = nullptr;
this->m_size = 0;
#endif
return result;
}
template <typename U>
friend std::pair<uint32_t, impl::arg_out<U>> detach_abi(com_array<U>& object) noexcept;
};
template <typename C> com_array(uint32_t, C const&) -> com_array<std::decay_t<C>>;
template <typename InIt, typename = std::void_t<typename std::iterator_traits<InIt>::difference_type>>
com_array(InIt, InIt) -> com_array<std::decay_t<typename std::iterator_traits<InIt>::value_type>>;
template <typename C> com_array(std::vector<C> const&) -> com_array<std::decay_t<C>>;
template <size_t N, typename C> com_array(std::array<C, N> const&) -> com_array<std::decay_t<C>>;
template <size_t N, typename C> com_array(C const(&)[N]) -> com_array<std::decay_t<C>>;
template <typename C> com_array(std::initializer_list<C>) -> com_array<std::decay_t<C>>;
#ifdef __cpp_lib_span
template <typename C, size_t extent> com_array(std::span<C, extent> const& value) -> com_array<std::decay_t<C>>;
#endif
namespace impl
{
template <typename T, typename U>
inline constexpr bool array_comparable = std::is_same_v<std::remove_cv_t<T>, std::remove_cv_t<U>>;
}
template <typename T, typename U,
std::enable_if_t<impl::array_comparable<T, U>, int> = 0>
bool operator==(array_view<T> const& left, array_view<U> const& right) noexcept
{
return std::equal(left.begin(), left.end(), right.begin(), right.end());
}
template <typename T, typename U,
std::enable_if_t<impl::array_comparable<T, U>, int> = 0>
bool operator<(array_view<T> const& left, array_view<U> const& right) noexcept
{
return std::lexicographical_compare(left.begin(), left.end(), right.begin(), right.end());
}
template <typename T, typename U, std::enable_if_t<impl::array_comparable<T, U>, int> = 0>
bool operator!=(array_view<T> const& left, array_view<U> const& right) noexcept { return !(left == right); }
template <typename T, typename U,std::enable_if_t<impl::array_comparable<T, U>, int> = 0>
bool operator>(array_view<T> const& left, array_view<U> const& right) noexcept { return right < left; }
template <typename T, typename U,std::enable_if_t<impl::array_comparable<T, U>, int> = 0>
bool operator<=(array_view<T> const& left, array_view<U> const& right) noexcept { return !(right < left); }
template <typename T, typename U, std::enable_if_t<impl::array_comparable<T, U>, int> = 0>
bool operator>=(array_view<T> const& left, array_view<U> const& right) noexcept { return !(left < right); }
template <typename T>
auto get_abi(array_view<T> object) noexcept
{
auto data = object.size() ? object.data() : (T*)alignof(T);
if constexpr (std::is_base_of_v<Windows::Foundation::IUnknown, T>)
{
return (void**)data;
}
else
{
return reinterpret_cast<impl::arg_out<std::remove_const_t<T>>>(const_cast<std::remove_const_t<T>*>(data));
}
}
template <typename T>
auto put_abi(array_view<T> object) noexcept
{
if constexpr (!std::is_trivially_destructible_v<T>)
{
std::fill(object.begin(), object.end(), impl::empty_value<T>());
}
return get_abi(object);
}
template<typename T>
auto put_abi(com_array<T>& object) noexcept
{
object.clear();
return reinterpret_cast<impl::arg_out<T>*>(&object);
}
template <typename T>
std::pair<uint32_t, impl::arg_out<T>> detach_abi(com_array<T>& object) noexcept
{
return object.detach_abi();
}
template <typename T>
auto detach_abi(com_array<T>&& object) noexcept
{
return detach_abi(object);
}
}
namespace winrt::impl
{
template <typename T>
struct array_size_proxy
{
array_size_proxy& operator=(array_size_proxy const&) = delete;
array_size_proxy(com_array<T>& value) noexcept : m_value(value)
{}
~array_size_proxy() noexcept
{
WINRT_ASSERT(m_value.data() || (!m_value.data() && m_size == 0));
*reinterpret_cast<uint32_t*>(reinterpret_cast<uintptr_t*>(&m_value) + 1) = m_size;
}
operator uint32_t*() noexcept
{
return &m_size;
}
operator unsigned long*() noexcept
{
return reinterpret_cast<unsigned long*>(&m_size);
}
private:
com_array<T>& m_value;
uint32_t m_size{ 0 };
};
template<typename T>
array_size_proxy<T> put_size_abi(com_array<T>& object) noexcept
{
return array_size_proxy<T>(object);
}
template <typename T>
struct com_array_proxy
{
com_array_proxy(uint32_t* size, winrt::impl::arg_out<T>* value) noexcept : m_size(size), m_value(value)
{}
~com_array_proxy() noexcept
{
std::tie(*m_size, *m_value) = detach_abi(m_temp);
}
operator com_array<T>&() noexcept
{
return m_temp;
}
com_array_proxy(com_array_proxy const&) noexcept
{
// A Visual C++ compiler bug (550631) requires the copy constructor even though it is never called.
WINRT_ASSERT(false);
}
private:
uint32_t* m_size;
arg_out<T>* m_value;
com_array<T> m_temp;
};
}
WINRT_EXPORT namespace winrt
{
template <typename T>
auto detach_abi(uint32_t* __valueSize, impl::arg_out<T>* value) noexcept
{
return impl::com_array_proxy<T>(__valueSize, value);
}
inline hstring get_class_name(Windows::Foundation::IInspectable const& object)
{
void* value{};
check_hresult((*(impl::inspectable_abi**)&object)->GetRuntimeClassName(&value));
return { value, take_ownership_from_abi };
}
inline com_array<guid> get_interfaces(Windows::Foundation::IInspectable const& object)
{
com_array<guid> value;
check_hresult((*(impl::inspectable_abi**)&object)->GetIids(impl::put_size_abi(value), put_abi(value)));
return value;
}
inline Windows::Foundation::TrustLevel get_trust_level(Windows::Foundation::IInspectable const& object)
{
Windows::Foundation::TrustLevel value{};
check_hresult((*(impl::inspectable_abi**)&object)->GetTrustLevel(&value));
return value;
}
}