forked from PixarAnimationStudios/OpenUSD
-
Notifications
You must be signed in to change notification settings - Fork 0
/
childrenProxy.h
482 lines (411 loc) · 12 KB
/
childrenProxy.h
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
//
// Copyright 2016 Pixar
//
// Licensed under the Apache License, Version 2.0 (the "Apache License")
// with the following modification; you may not use this file except in
// compliance with the Apache License and the following modification to it:
// Section 6. Trademarks. is deleted and replaced with:
//
// 6. Trademarks. This License does not grant permission to use the trade
// names, trademarks, service marks, or product names of the Licensor
// and its affiliates, except as required to comply with Section 4(c) of
// the License and to reproduce the content of the NOTICE file.
//
// You may obtain a copy of the Apache License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the Apache License with the above modification is
// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, either express or implied. See the Apache License for the specific
// language governing permissions and limitations under the Apache License.
//
#ifndef PXR_USD_SDF_CHILDREN_PROXY_H
#define PXR_USD_SDF_CHILDREN_PROXY_H
/// \file sdf/childrenProxy.h
#include "pxr/pxr.h"
#include "pxr/usd/sdf/api.h"
#include "pxr/usd/sdf/changeBlock.h"
#include "pxr/base/vt/value.h"
#include "pxr/base/tf/diagnostic.h"
#include "pxr/base/tf/iterator.h"
#include <boost/iterator/iterator_facade.hpp>
#include <boost/iterator/reverse_iterator.hpp>
#include <iterator>
#include <map>
#include <utility>
PXR_NAMESPACE_OPEN_SCOPE
template <class _View>
class SdfChildrenProxy {
public:
typedef _View View;
typedef typename View::Adapter Adapter;
typedef typename View::ChildPolicy ChildPolicy;
typedef typename View::key_type key_type;
typedef typename View::value_type mapped_type;
typedef std::vector<mapped_type> mapped_vector_type;
typedef std::pair<const key_type, mapped_type> value_type;
typedef std::map<key_type, mapped_type> map_type;
typedef typename View::size_type size_type;
typedef SdfChildrenProxy<View> This;
private:
typedef typename View::const_iterator _inner_iterator;
class _ValueProxy {
public:
_ValueProxy() : _owner(NULL) { }
_ValueProxy(This* owner, _inner_iterator i) : _owner(owner), _pos(i)
{
// Do nothing
}
operator mapped_type() const
{
return *_pos;
}
template <class U>
_ValueProxy& operator=(const U& x)
{
_owner->_Set(*_pos, x);
return *this;
}
bool operator==(const mapped_type& other) const
{
return *_pos == other;
}
private:
This* _owner;
_inner_iterator _pos;
};
class _PairProxy {
public:
explicit _PairProxy(This* owner, _inner_iterator i) :
first(owner->_view.key(i)), second(owner, i) { }
const key_type first;
_ValueProxy second;
operator value_type() const
{
return value_type(first, second);
}
};
friend class _PairProxy;
class _Traits {
public:
static value_type Dereference(const This* owner, _inner_iterator i)
{
return value_type(owner->_view.key(i), *i);
}
static _PairProxy Dereference(This* owner, _inner_iterator i)
{
return _PairProxy(owner, i);
}
};
template <class _Owner, class _Iter, class _Value>
class _Iterator :
public boost::iterator_facade<
_Iterator<_Owner, _Iter, _Value>,
_Value,
std::bidirectional_iterator_tag,
_Value> {
public:
_Iterator() { }
_Iterator(_Owner owner, _inner_iterator i) : _owner(owner), _pos(i) { }
template <class O2, class I2, class V2>
_Iterator(const _Iterator<O2, I2, V2>& other) :
_owner(other._owner), _pos(other._pos) { }
private:
friend class boost::iterator_core_access;
_Value dereference() const
{
return _Traits::Dereference(_owner, _pos);
}
template <class O2, class I2, class V2>
bool equal(const _Iterator<O2, I2, V2>& other) const
{
return _pos == other._pos;
}
void increment() {
++_pos;
}
void decrement() {
--_pos;
}
private:
_Owner _owner;
_inner_iterator _pos;
template <class O2, class I2, class V2>
friend class _Iterator;
};
public:
typedef _ValueProxy reference;
typedef _Iterator<This*, _inner_iterator, _PairProxy> iterator;
typedef boost::reverse_iterator<iterator> reverse_iterator;
typedef _Iterator<const This*, _inner_iterator, value_type> const_iterator;
typedef boost::reverse_iterator<const_iterator> const_reverse_iterator;
static const int CanSet = 1;
static const int CanInsert = 2;
static const int CanErase = 4;
SdfChildrenProxy(const View& view, const std::string& type,
int permission = CanSet | CanInsert | CanErase) :
_view(view), _type(type), _permission(permission)
{
// Do nothing
}
template <class U>
SdfChildrenProxy(const SdfChildrenProxy<U>& other) :
_view(other._view), _type(other._type), _permission(other._permission)
{
// Do nothing
}
This& operator=(const This& other)
{
if (other._Validate()) {
_Copy(other._view.values());
}
return *this;
}
template <class U>
This& operator=(const SdfChildrenProxy<U>& other)
{
if (other._Validate()) {
_Copy(other._view.values());
}
return *this;
}
This& operator=(const mapped_vector_type& values)
{
_Copy(values);
return *this;
}
operator mapped_vector_type() const
{
return _Validate() ? _view.values() : mapped_vector_type();
}
map_type items() const
{
return _Validate() ? _view.template items_as<map_type>() :map_type();
}
iterator begin()
{
return iterator(_GetThis(), _view.begin());
}
iterator end()
{
return iterator(_GetThis(), _view.end());
}
const_iterator begin() const
{
return const_iterator(_GetThis(), _view.begin());
}
const_iterator end() const
{
return const_iterator(_GetThis(), _view.end());
}
reverse_iterator rbegin()
{
return reverse_iterator(end());
}
reverse_iterator rend()
{
return reverse_iterator(begin());
}
const_reverse_iterator rbegin() const
{
return reverse_iterator(end());
}
const_reverse_iterator rend() const
{
return reverse_iterator(begin());
}
size_type size() const
{
return _Validate() ? _view.size() : 0;
}
size_type max_size() const
{
return _view.max_size();
}
bool empty() const
{
return _Validate() ? _view.empty() : true;
}
std::pair<iterator, bool> insert(const mapped_type& value)
{
if (_Validate(CanInsert)) {
iterator i = find(_view.key(value));
if (i == end()) {
if (_PrimInsert(value, size())) {
return std::make_pair(find(_view.key(value)), true);
}
else {
return std::make_pair(end(), false);
}
}
else {
return std::make_pair(i, false);
}
}
else {
return std::make_pair(iterator(), false);
}
}
iterator insert(iterator pos, const mapped_type& value)
{
return insert(value).first;
}
template <class InputIterator>
void insert(InputIterator first, InputIterator last)
{
if (_Validate(CanInsert)) {
SdfChangeBlock block;
for (; first != last; ++first) {
_PrimInsert(*first, size());
}
}
}
void erase(iterator pos)
{
_Erase(pos->first);
}
size_type erase(const key_type& key)
{
return _Erase(key) ? 1 : 0;
}
void erase(iterator first, iterator last)
{
if (_Validate(CanErase)) {
SdfChangeBlock block;
while (first != last) {
const key_type& key = first->first;
++first;
_PrimErase(key);
}
}
}
void clear()
{
_Copy(mapped_vector_type());
}
iterator find(const key_type& key)
{
return _Validate() ? iterator(this, _view.find(key)) : iterator();
}
const_iterator find(const key_type& key) const
{
return _Validate() ? const_iterator(this, _view.find(key)) :
const_iterator();
}
size_type count(const key_type& key) const
{
return _Validate() ? _view.count(key) : 0;
}
bool operator==(const This& other) const
{
return _view == other._view;
}
bool operator!=(const This& other) const
{
return !(*this == other);
}
/// Explicit bool conversion operator. The proxy object converts to
/// \c true if it is valid, \c false otherwise.
explicit operator bool() const
{
return _view.IsValid();
}
private:
const std::string& _GetType() const
{
return _type;
}
int _GetPermission() const
{
return _permission;
}
This* _GetThis()
{
return _Validate() ? this : NULL;
}
const This* _GetThis() const
{
return _Validate() ? this : NULL;
}
bool _Validate() const
{
if (_view.IsValid()) {
return true;
}
else {
TF_CODING_ERROR("Accessing expired %s", _type.c_str());
return false;
}
}
bool _Validate(int permission)
{
if (!_Validate()) {
return false;
}
if ((_permission & permission) == permission) {
return true;
}
const char* op = "edit";
if (~_permission & permission & CanSet) {
op = "replace";
}
else if (~_permission & permission & CanInsert) {
op = "insert";
}
else if (~_permission & permission & CanErase) {
op = "remove";
}
TF_CODING_ERROR("Cannot %s %s", op, _type.c_str());
return false;
}
bool _Copy(const mapped_vector_type& values)
{
return _Validate(CanSet) ? _PrimCopy(values) : false;
}
bool _Insert(const mapped_type& value, size_t index)
{
return _Validate(CanInsert) ? _PrimInsert(value, index) : false;
}
bool _Erase(const key_type& key)
{
return _Validate(CanErase) ? _PrimErase(key) : false;
}
bool _PrimCopy(const mapped_vector_type& values)
{
typedef std::vector<typename ChildPolicy::ValueType>
ChildrenValueVector;
ChildrenValueVector v;
for (size_t i = 0; i < values.size(); ++i)
v.push_back(Adapter::Convert(values[i]));
return _view.GetChildren().Copy(v, _type);
}
bool _PrimInsert(const mapped_type& value, size_t index)
{
return _view.GetChildren().Insert(
Adapter::Convert(value), index, _type);
}
bool _PrimErase(const key_type& key)
{
return _view.GetChildren().Erase(key, _type);
}
private:
View _view;
std::string _type;
int _permission;
template <class V> friend class SdfChildrenProxy;
template <class V> friend class SdfPyChildrenProxy;
};
// Allow TfIteration over children proxies.
template <typename _View>
struct Tf_ShouldIterateOverCopy<SdfChildrenProxy<_View> > : std::true_type
{
};
// Cannot get from a VtValue except as the correct type.
template <class _View>
struct Vt_DefaultValueFactory<SdfChildrenProxy<_View> > {
static Vt_DefaultValueHolder Invoke() = delete;
};
PXR_NAMESPACE_CLOSE_SCOPE
#endif // PXR_USD_SDF_CHILDREN_PROXY_H