 |
Entry of changes at a single path in namespace. More...
Public Types | |
|
typedef std::pair< VtValue, VtValue > | InfoChange |
|
typedef TfSmallVector < std::pair< TfToken, InfoChange >, 3 > | InfoChangeVec |
|
typedef std::pair< std::string, SubLayerChangeType > | SubLayerChange |
Public Member Functions | |
| InfoChangeVec::const_iterator | FindInfoChange (TfToken const &key) const |
Return the iterator in infoChanged whose first element is key, or infoChanged.end() if there is no such element. More... | |
| bool | HasInfoChange (TfToken const &key) const |
Return true if this entry has an info change for key, false otherwise. More... | |
Public Attributes | |
| InfoChangeVec | infoChanged |
| std::vector< SubLayerChange > | subLayerChanges |
| SdfPath | oldPath |
| std::string | oldIdentifier |
| _Flags | flags |
Entry of changes at a single path in namespace.
If the path is SdfPath::AbsoluteRootPath(), that indicates a change to the root of namespace (that is, a layer or stage).
Note: Our language for invalidation used to be more precise about items added, removed, or reordered. It might seem that this would afford more opportunities for efficient updates, but in practice it does not. Because our derived data typically must recompose or reinstantiate based on the underlying data, the particular delta might be ignored, overridden, or invalid. It is simpler to treat all changes identically, and focus on making the common base case fast, rather than have complicated differential update logic. It also vastly simplifies the language of invalidation.
Definition at line 116 of file changeList.h.
|
inline |
Return the iterator in infoChanged whose first element is key, or infoChanged.end() if there is no such element.
Definition at line 127 of file changeList.h.
|
inline |
Return true if this entry has an info change for key, false otherwise.
Definition at line 140 of file changeList.h.
1.8.5 
