forked from PixarAnimationStudios/OpenUSD
-
Notifications
You must be signed in to change notification settings - Fork 0
/
data.cpp
517 lines (457 loc) · 13.6 KB
/
data.cpp
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
//
// 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.
//
#include "pxr/pxr.h"
#include "pxr/usd/sdf/data.h"
#include "pxr/base/trace/trace.h"
#include "pxr/base/work/utils.h"
#include <iostream>
PXR_NAMESPACE_OPEN_SCOPE
SdfData::~SdfData()
{
// Clear out _data in parallel, since it can get big.
WorkSwapDestroyAsync(_data);
}
bool
SdfData::StreamsData() const
{
return false;
}
bool
SdfData::HasSpec(const SdfPath &path) const
{
return _data.find(path) != _data.end();
}
void
SdfData::EraseSpec(const SdfPath &path)
{
_HashTable::iterator i = _data.find(path);
if (!TF_VERIFY(i != _data.end(),
"No spec to erase at <%s>", path.GetText())) {
return;
}
_data.erase(i);
}
void
SdfData::MoveSpec(const SdfPath &oldPath,
const SdfPath &newPath)
{
_HashTable::iterator old = _data.find(oldPath);
if (!TF_VERIFY(old != _data.end(),
"No spec to move at <%s>", oldPath.GetString().c_str())) {
return;
}
bool inserted = _data.insert(std::make_pair(newPath, old->second)).second;
if (!TF_VERIFY(inserted)) {
return;
}
_data.erase(old);
}
SdfSpecType
SdfData::GetSpecType(const SdfPath &path) const
{
_HashTable::const_iterator i = _data.find(path);
if (i == _data.end()) {
return SdfSpecTypeUnknown;
}
return i->second.specType;
}
void
SdfData::CreateSpec(const SdfPath &path, SdfSpecType specType)
{
if (!TF_VERIFY(specType != SdfSpecTypeUnknown)) {
return;
}
_data[path].specType = specType;
}
void
SdfData::_VisitSpecs(SdfAbstractDataSpecVisitor* visitor) const
{
TF_FOR_ALL(it, _data) {
if (!visitor->VisitSpec(*this, it->first)) {
break;
}
}
}
bool
SdfData::Has(const SdfPath &path, const TfToken &field,
SdfAbstractDataValue* value) const
{
if (const VtValue* fieldValue = _GetFieldValue(path, field)) {
if (value) {
return value->StoreValue(*fieldValue);
}
return true;
}
return false;
}
bool
SdfData::Has(const SdfPath &path, const TfToken & field,
VtValue *value) const
{
if (const VtValue* fieldValue = _GetFieldValue(path, field)) {
if (value) {
*value = *fieldValue;
}
return true;
}
return false;
}
bool
SdfData::HasSpecAndField(
const SdfPath &path, const TfToken &fieldName,
SdfAbstractDataValue *value, SdfSpecType *specType) const
{
if (VtValue const *v =
_GetSpecTypeAndFieldValue(path, fieldName, specType)) {
return !value || value->StoreValue(*v);
}
return false;
}
bool
SdfData::HasSpecAndField(
const SdfPath &path, const TfToken &fieldName,
VtValue *value, SdfSpecType *specType) const
{
if (VtValue const *v =
_GetSpecTypeAndFieldValue(path, fieldName, specType)) {
if (value) {
*value = *v;
}
return true;
}
return false;
}
const VtValue*
SdfData::_GetSpecTypeAndFieldValue(const SdfPath& path,
const TfToken& field,
SdfSpecType* specType) const
{
_HashTable::const_iterator i = _data.find(path);
if (i == _data.end()) {
*specType = SdfSpecTypeUnknown;
}
else {
const _SpecData &spec = i->second;
*specType = spec.specType;
for (auto const &f: spec.fields) {
if (f.first == field) {
return &f.second;
}
}
}
return nullptr;
}
const VtValue*
SdfData::_GetFieldValue(const SdfPath &path,
const TfToken &field) const
{
_HashTable::const_iterator i = _data.find(path);
if (i != _data.end()) {
const _SpecData & spec = i->second;
for (auto const &f: spec.fields) {
if (f.first == field) {
return &f.second;
}
}
}
return nullptr;
}
VtValue*
SdfData::_GetMutableFieldValue(const SdfPath &path,
const TfToken &field)
{
_HashTable::iterator i = _data.find(path);
if (i != _data.end()) {
_SpecData &spec = i->second;
for (size_t j=0, jEnd = spec.fields.size(); j != jEnd; ++j) {
if (spec.fields[j].first == field) {
return &spec.fields[j].second;
}
}
}
return NULL;
}
VtValue
SdfData::Get(const SdfPath &path, const TfToken & field) const
{
if (const VtValue *value = _GetFieldValue(path, field)) {
return *value;
}
return VtValue();
}
void
SdfData::Set(const SdfPath &path, const TfToken & field,
const VtValue& value)
{
TfAutoMallocTag2 tag("Sdf", "SdfData::Set");
if (value.IsEmpty()) {
Erase(path, field);
return;
}
VtValue* newValue = _GetOrCreateFieldValue(path, field);
if (newValue) {
*newValue = value;
}
}
void
SdfData::Set(const SdfPath &path, const TfToken &field,
const SdfAbstractDataConstValue& value)
{
TfAutoMallocTag2 tag("Sdf", "SdfData::Set");
VtValue* newValue = _GetOrCreateFieldValue(path, field);
if (newValue) {
value.GetValue(newValue);
}
}
VtValue*
SdfData::_GetOrCreateFieldValue(const SdfPath &path,
const TfToken &field)
{
_HashTable::iterator i = _data.find(path);
if (!TF_VERIFY(i != _data.end(),
"No spec at <%s> when trying to set field '%s'",
path.GetText(), field.GetText())) {
return nullptr;
}
_SpecData &spec = i->second;
for (auto &f: spec.fields) {
if (f.first == field) {
return &f.second;
}
}
spec.fields.emplace_back(std::piecewise_construct,
std::forward_as_tuple(field),
std::forward_as_tuple());
return &spec.fields.back().second;
}
void
SdfData::Erase(const SdfPath &path, const TfToken & field)
{
_HashTable::iterator i = _data.find(path);
if (i == _data.end()) {
return;
}
_SpecData &spec = i->second;
for (size_t j=0, jEnd = spec.fields.size(); j != jEnd; ++j) {
if (spec.fields[j].first == field) {
spec.fields.erase(spec.fields.begin()+j);
return;
}
}
}
std::vector<TfToken>
SdfData::List(const SdfPath &path) const
{
std::vector<TfToken> names;
_HashTable::const_iterator i = _data.find(path);
if (i != _data.end()) {
const _SpecData & spec = i->second;
const size_t numFields = spec.fields.size();
names.resize(numFields);
for (size_t j=0; j != numFields; ++j) {
names[j] = spec.fields[j].first;
}
}
return names;
}
////////////////////////////////////////////////////////////////////////
// This is a basic prototype implementation of the time-sampling API
// for in-memory, non cached presto layers.
std::set<double>
SdfData::ListAllTimeSamples() const
{
// Use a set to determine unique times.
std::set<double> times;
TF_FOR_ALL(i, _data) {
std::set<double> timesForPath = ListTimeSamplesForPath(i->first);
times.insert(timesForPath.begin(), timesForPath.end());
}
return times;
}
std::set<double>
SdfData::ListTimeSamplesForPath(const SdfPath &path) const
{
std::set<double> times;
VtValue value = Get(path, SdfDataTokens->TimeSamples);
if (value.IsHolding<SdfTimeSampleMap>()) {
const SdfTimeSampleMap & timeSampleMap =
value.UncheckedGet<SdfTimeSampleMap>();
TF_FOR_ALL(j, timeSampleMap) {
times.insert(j->first);
}
}
return times;
}
template <class Container, class GetTime>
static bool
_GetBracketingTimeSamplesImpl(
const Container &samples, const GetTime &getTime,
const double time, double* tLower, double* tUpper)
{
if (samples.empty()) {
// No samples.
return false;
} else if (time <= getTime(*samples.begin())) {
// Time is at-or-before the first sample.
*tLower = *tUpper = getTime(*samples.begin());
} else if (time >= getTime(*samples.rbegin())) {
// Time is at-or-after the last sample.
*tLower = *tUpper = getTime(*samples.rbegin());
} else {
auto iter = samples.lower_bound(time);
if (getTime(*iter) == time) {
// Time is exactly on a sample.
*tLower = *tUpper = getTime(*iter);
} else {
// Time is in-between samples; return the bracketing times.
*tUpper = getTime(*iter);
--iter;
*tLower = getTime(*iter);
}
}
return true;
}
static bool
_GetBracketingTimeSamples(const std::set<double> &samples, double time,
double *tLower, double *tUpper)
{
return _GetBracketingTimeSamplesImpl(samples, [](double t) { return t; },
time, tLower, tUpper);
}
static bool
_GetBracketingTimeSamples(const SdfTimeSampleMap &samples, double time,
double *tLower, double *tUpper)
{
return _GetBracketingTimeSamplesImpl(
samples, [](SdfTimeSampleMap::value_type const &p) { return p.first; },
time, tLower, tUpper);
}
bool
SdfData::GetBracketingTimeSamples(
double time, double* tLower, double* tUpper) const
{
return _GetBracketingTimeSamples(
ListAllTimeSamples(), time, tLower, tUpper);
}
size_t
SdfData::GetNumTimeSamplesForPath(const SdfPath &path) const
{
if (const VtValue *fval = _GetFieldValue(path, SdfDataTokens->TimeSamples)) {
if (fval->IsHolding<SdfTimeSampleMap>()) {
return fval->UncheckedGet<SdfTimeSampleMap>().size();
}
}
return 0;
}
bool
SdfData::GetBracketingTimeSamplesForPath(
const SdfPath &path, double time,
double* tLower, double* tUpper) const
{
const VtValue *fval = _GetFieldValue(path, SdfDataTokens->TimeSamples);
if (fval && fval->IsHolding<SdfTimeSampleMap>()) {
auto const &tsmap = fval->UncheckedGet<SdfTimeSampleMap>();
return _GetBracketingTimeSamples(tsmap, time, tLower, tUpper);
}
return false;
}
bool
SdfData::QueryTimeSample(const SdfPath &path, double time,
VtValue *value) const
{
const VtValue *fval = _GetFieldValue(path, SdfDataTokens->TimeSamples);
if (fval && fval->IsHolding<SdfTimeSampleMap>()) {
auto const &tsmap = fval->UncheckedGet<SdfTimeSampleMap>();
auto iter = tsmap.find(time);
if (iter != tsmap.end()) {
if (value)
*value = iter->second;
return true;
}
}
return false;
}
bool
SdfData::QueryTimeSample(const SdfPath &path, double time,
SdfAbstractDataValue* value) const
{
const VtValue *fval = _GetFieldValue(path, SdfDataTokens->TimeSamples);
if (fval && fval->IsHolding<SdfTimeSampleMap>()) {
auto const &tsmap = fval->UncheckedGet<SdfTimeSampleMap>();
auto iter = tsmap.find(time);
if (iter != tsmap.end()) {
return !value || value->StoreValue(iter->second);
}
}
return false;
}
void
SdfData::SetTimeSample(const SdfPath &path, double time,
const VtValue& value)
{
if (value.IsEmpty()) {
EraseTimeSample(path, time);
return;
}
SdfTimeSampleMap newSamples;
// Attempt to get a pointer to an existing timeSamples field.
VtValue *fieldValue =
_GetMutableFieldValue(path, SdfDataTokens->TimeSamples);
// If we have one, swap it out so we can modify it.
if (fieldValue && fieldValue->IsHolding<SdfTimeSampleMap>()) {
fieldValue->UncheckedSwap(newSamples);
}
// Insert or overwrite into newSamples.
newSamples[time] = value;
// Set back into the field.
if (fieldValue) {
fieldValue->Swap(newSamples);
} else {
Set(path, SdfDataTokens->TimeSamples, VtValue::Take(newSamples));
}
}
void
SdfData::EraseTimeSample(const SdfPath &path, double time)
{
SdfTimeSampleMap newSamples;
// Attempt to get a pointer to an existing timeSamples field.
VtValue *fieldValue =
_GetMutableFieldValue(path, SdfDataTokens->TimeSamples);
// If we have one, swap it out so we can modify it. If we do not have one,
// there's nothing to erase so we're done.
if (fieldValue && fieldValue->IsHolding<SdfTimeSampleMap>()) {
fieldValue->UncheckedSwap(newSamples);
} else {
return;
}
// Erase from newSamples.
newSamples.erase(time);
// Check to see if the result is empty. In that case we remove the field.
if (newSamples.empty()) {
Erase(path, SdfDataTokens->TimeSamples);
} else {
fieldValue->UncheckedSwap(newSamples);
}
}
PXR_NAMESPACE_CLOSE_SCOPE