24 #ifndef PXR_USD_SDF_PATH_H
25 #define PXR_USD_SDF_PATH_H
35 #include <hboost/intrusive_ptr.hpp>
36 #include <hboost/operators.hpp>
42 #include <type_traits>
62 struct Sdf_PathPrimTag;
63 struct Sdf_PathPropTag;
66 static constexpr
size_t Sdf_SizeofPrimPathNode =
sizeof(
void *) * 3;
67 static constexpr
size_t Sdf_SizeofPropPathNode =
sizeof(
void *) * 3;
70 Sdf_PathPrimTag, Sdf_SizeofPrimPathNode, 8>;
73 Sdf_PathPropTag, Sdf_SizeofPropPathNode, 8>;
79 template <
class Handle,
bool Counted,
class PathNode=Sdf_PathNode const>
91 : _poolHandle(
Handle::GetHandle(reinterpret_cast<char
const *>(p))) {
106 : _poolHandle(rhs._poolHandle) {
120 if (Counted && *
this == rhs) {
128 : _poolHandle(rhs._poolHandle) {
129 rhs._poolHandle =
nullptr;
145 _poolHandle =
Handle {
nullptr };
149 get()
const noexcept {
150 return reinterpret_cast<Sdf_PathNode *
>(_poolHandle.GetPtr());
163 explicit operator bool()
const noexcept {
164 return static_cast<bool>(_poolHandle);
168 _poolHandle.swap(rhs._poolHandle);
172 return _poolHandle == rhs._poolHandle;
175 return _poolHandle != rhs._poolHandle;
178 return _poolHandle < rhs._poolHandle;
188 void _AddRef()
const {
192 void _DecRef()
const {
198 Handle _poolHandle {
nullptr };
290 class SdfPath : hboost::totally_ordered<SdfPath>
311 memset(
this, 0,
sizeof(*
this));
393 return static_cast<bool>(_propPart);
745 bool fixTargetPaths=
true)
const;
767 std::pair<SdfPath, SdfPath>
769 bool stopAtRootPrim =
false)
const;
866 static std::pair<std::string, bool>
886 return _AsInt() == rhs._AsInt();
894 if (_AsInt() == rhs._AsInt()) {
897 if (!_primPart || !rhs._primPart) {
898 return !_primPart && rhs._primPart;
901 return _LessThanInternal(*
this, rhs);
904 template <
class HashState>
908 uint32_t primPart, propPart;
909 memcpy(&primPart, &path._primPart,
sizeof(primPart));
910 memcpy(&propPart, &path._propPart,
sizeof(propPart));
923 return Hash()(*this);
930 return a._AsInt() < b._AsInt();
967 : _primPart(std::move(primNode)) {}
971 : _primPart(std::move(primPart))
972 , _propPart(std::move(propPart)) {}
977 : _primPart(primPart)
978 , _propPart(propPart) {}
983 : _primPart(primPart)
984 , _propPart(propPart) {}
992 _ElementsToString(
bool absolute,
const std::vector<std::string> &elements);
995 SdfPath const &newPrefix)
const;
998 SdfPath const &newPrefix)
const;
1002 bool fixTargetPaths)
const;
1008 inline uint64_t _AsInt()
const {
1009 static_assert(
sizeof(*
this) ==
sizeof(uint64_t),
"");
1011 std::memcpy(&ret,
this,
sizeof(*
this));
1016 lhs._primPart.
swap(rhs._primPart);
1017 lhs._propPart.
swap(rhs._propPart);
1118 template <
class ForwardIterator,
class GetPathFn = Sdf_PathIdentity>
1119 std::pair<ForwardIterator, ForwardIterator>
1122 GetPathFn
const &getPath = GetPathFn()) {
1127 Compare(GetPathFn
const &getPath) : _getPath(getPath) {}
1128 GetPathFn
const &_getPath;
1129 bool operator()(IterRef
a,
SdfPath const &
b)
const {
1130 return _getPath(a) <
b;
1134 std::pair<ForwardIterator, ForwardIterator>
result;
1137 result.first = std::lower_bound(begin, end, prefix, Compare(getPath));
1141 result.second = TfFindBoundary(result.first, end,
1142 [&prefix, &getPath](IterRef iterRef) {
1143 return getPath(iterRef).HasPrefix(prefix);
1149 template <
class RandomAccessIterator,
class GetPathFn>
1150 RandomAccessIterator
1152 RandomAccessIterator
end,
1155 GetPathFn
const &getPath)
1161 Compare(GetPathFn
const &getPath) : _getPath(getPath) {}
1162 GetPathFn
const &_getPath;
1163 bool operator()(IterRef
a,
SdfPath const &
b)
const {
1164 return _getPath(a) <
b;
1177 Compare comp(getPath);
1180 RandomAccessIterator
result = std::lower_bound(begin, end, path, comp);
1184 if (!strictPrefix && result != end && getPath(*result) == path) {
1190 if (result == begin) {
1195 if (path.
HasPrefix(getPath(*--result))) {
1205 result = std::lower_bound(begin, end, newPath, comp);
1207 if (result != end && getPath(*result) == newPath) {
1210 if (result == begin) {
1213 if (newPath.
HasPrefix(getPath(*--result))) {
1228 class =
typename std::enable_if<
1230 std::random_access_iterator_tag,
1231 typename std::iterator_traits<
1232 RandomAccessIterator>::iterator_category
1236 RandomAccessIterator
1238 RandomAccessIterator
end,
1240 GetPathFn
const &getPath = GetPathFn())
1243 begin, end, path,
false, getPath);
1254 class =
typename std::enable_if<
1256 std::random_access_iterator_tag,
1257 typename std::iterator_traits<
1258 RandomAccessIterator>::iterator_category
1262 RandomAccessIterator
1264 RandomAccessIterator end,
1266 GetPathFn
const &getPath = GetPathFn())
1269 begin, end, path,
true, getPath);
1272 template <
class Iter,
class MapParam,
class GetPathFn = Sdf_PathIdentity>
1275 MapParam map,
SdfPath const &path,
bool strictPrefix,
1276 GetPathFn
const &getPath = GetPathFn())
1283 const Iter mapEnd = map.end();
1290 Iter
result = map.lower_bound(path);
1294 if (!strictPrefix && result != mapEnd && getPath(*result) == path)
1299 if (result == map.begin())
1310 return Sdf_PathFindLongestPrefixImpl<Iter, MapParam>(
1319 typename std::set<SdfPath>::const_iterator
1326 typename std::map<SdfPath, T>::const_iterator
1330 typename std::map<SdfPath, T>::const_iterator,
1331 std::map<SdfPath, T>
const &>(map,
path,
false,
1335 typename std::map<SdfPath, T>::iterator
1339 typename std::map<SdfPath, T>::iterator,
1340 std::map<SdfPath, T> &>(map,
path,
false,
1348 typename std::set<SdfPath>::const_iterator
1356 typename std::map<SdfPath, T>::const_iterator
1358 std::map<SdfPath, T>
const &map,
SdfPath const &path)
1361 typename std::map<SdfPath, T>::const_iterator,
1362 std::map<SdfPath, T>
const &>(map,
path,
true,
1366 typename std::map<SdfPath, T>::iterator
1368 std::map<SdfPath, T> &map,
SdfPath const &path)
1371 typename std::map<SdfPath, T>::iterator,
1372 std::map<SdfPath, T> &>(map,
path,
true,
1399 #endif // PXR_USD_SDF_PATH_H
SDF_API const char * GetText() const
SDF_API bool IsPrimOrPrimVariantSelectionPath() const
SDF_API SdfPath AppendTarget(const SdfPath &targetPath) const
SDF_API bool IsMapperPath() const
Returns whether the path identifies a connection mapper.
GLboolean GLboolean GLboolean b
friend void swap(SdfPath &lhs, SdfPath &rhs)
SDF_API iterator & operator++()
SDF_API const std::string & GetName() const
static SDF_API const SdfPath & AbsoluteRootPath()
friend class Sdfext_PathAccess
static constexpr bool IsCounted
Sdf_PathNodeHandleImpl(Sdf_PathNodeHandleImpl const &rhs) noexcept
SDF_API std::string GetElementString() const
SDF_API bool IsExpressionPath() const
Returns whether the path identifies a connection expression.
SDF_API SdfPath AppendExpression() const
iterator(const SdfPath &path)
Sdf_PathNodeHandleImpl(Handle h, bool add_ref=true)
SDF_API SdfPath AppendMapper(const SdfPath &targetPath) const
STATIC_INLINE size_t Hash(const char *s, size_t len)
SDF_API char const * Sdf_PathGetDebuggerPathText(SdfPath const &)
bool operator==(const SdfPath &rhs) const
Sdf_PathPropPartPool::Handle Sdf_PathPropHandle
SDF_API SdfPath ReplaceTargetPath(const SdfPath &newTargetPath) const
std::pair< ForwardIterator, ForwardIterator > SdfPathFindPrefixedRange(ForwardIterator begin, ForwardIterator end, SdfPath const &prefix, GetPathFn const &getPath=GetPathFn())
static SDF_API bool IsValidPathString(const std::string &pathString, std::string *errMsg=0)
RandomAccessIterator Sdf_PathFindLongestPrefixImpl(RandomAccessIterator begin, RandomAccessIterator end, SdfPath const &path, bool strictPrefix, GetPathFn const &getPath)
SDF_API bool IsAbsoluteRootPath() const
Return true if this path is the AbsoluteRootPath().
GLsizei const GLchar *const * path
SDF_API bool IsMapperArgPath() const
Returns whether the path identifies a connection mapper arg.
GLenum const void GLuint GLint reference
SDF_API const SdfPath & GetTargetPath() const
GLenum GLsizei const void * pathString
SDF_API bool IsPrimPropertyPath() const
SDF_API SdfPath GetAbsoluteRootOrPrimPath() const
SdfPathAncestorsRange(const SdfPath &path)
SDF_API TfToken GetAsToken() const
Sdf_PathNodeHandleImpl & operator=(Sdf_PathNodeHandleImpl &&rhs) noexcept
bool operator==(const iterator &o) const
static SDF_API void RemoveDescendentPaths(SdfPathVector *paths)
bool IsEmpty() const noexcept
Returns true if this is the empty path (SdfPath::EmptyPath()).
bool operator==(Sdf_PathNodeHandleImpl const &rhs) const noexcept
GLuint const GLchar * name
Sdf_PathNodeHandleImpl(Sdf_PathNode const *p, bool add_ref=true)
auto arg(const Char *name, const T &arg) -> detail::named_arg< Char, T >
SdfPath const & operator()(SdfPath const &arg) const
SDF_API std::pair< std::string, std::string > GetVariantSelection() const
SDF_API SdfPath StripAllVariantSelections() const
bool operator!=(const iterator &o) const
SDF_API SdfPath AppendRelationalAttribute(TfToken const &attrName) const
static SDF_API std::vector< std::string > TokenizeIdentifier(const std::string &name)
static SDF_API const SdfPath & EmptyPath()
The empty path value, equivalent to SdfPath().
const SdfPath & operator*() const
bool operator<(const SdfPath &rhs) const
void swap(Sdf_PathNodeHandleImpl &rhs) noexcept
friend void TfHashAppend(HashState &h, SdfPath const &path)
SDF_API void GetAllTargetPathsRecursively(SdfPathVector *result) const
bool ContainsPropertyElements() const
SDF_API bool IsPrimVariantSelectionPath() const
bool operator!=(Sdf_PathNodeHandleImpl const &rhs) const noexcept
~Sdf_PathNodeHandleImpl()
void intrusive_ptr_add_ref(Sdf_PathNode const *)
SDF_API SdfPath AppendChild(TfToken const &childName) const
static SDF_API bool IsValidNamespacedIdentifier(const std::string &name)
Sdf_PathNode const & operator*() const
GLboolean GLboolean GLboolean GLboolean a
GLsizei const GLchar *const * string
SDF_API SdfPath AppendVariantSelection(const std::string &variantSet, const std::string &variant) const
SDF_API SdfPath AppendMapperArg(TfToken const &argName) const
SDF_API bool IsAbsolutePath() const
Returns whether the path is absolute.
static SDF_API std::string JoinIdentifier(const std::vector< std::string > &names)
std::vector< TfToken > TfTokenVector
Convenience types.
GLuint const GLuint * names
SDF_API bool ContainsTargetPath() const
static SDF_API bool IsValidIdentifier(const std::string &name)
SDF_API size_t GetPathElementCount() const
Returns the number of path elements in this path.
SDF_API TfToken GetElementToken() const
Like GetElementString() but return the value as a TfToken.
SDF_API const std::string & GetString() const
SDF_API bool IsPrimPath() const
Returns whether the path identifies a prim.
size_t operator()(const SdfPath &path) const
Sdf_PathPrimPartPool::Handle Sdf_PathPrimHandle
Sdf_PathNodeHandleImpl & operator=(Sdf_PathNode const *rhs) noexcept
std::vector< class SdfPath > SdfPathVector
A vector of SdfPaths.
constexpr Sdf_PathNodeHandleImpl() noexcept
SDF_API const TfToken & GetNameToken() const
SDF_API bool HasPrefix(const SdfPath &prefix) const
SDF_API bool IsRelationalAttributePath() const
std::set< class SdfPath > SdfPathSet
A set of SdfPaths.
SDF_API SdfPath AppendProperty(TfToken const &propName) const
SDF_API bool ContainsPrimVariantSelection() const
hboost::intrusive_ptr< const Sdf_PathNode > Sdf_PathNodeConstRefPtr
std::forward_iterator_tag iterator_category
GLfloat GLfloat GLfloat GLfloat h
bool operator<(Sdf_PathNodeHandleImpl const &rhs) const noexcept
SDF_API std::ostream & operator<<(std::ostream &out, const SdfPath &path)
Writes the string representation of path to out.
PXR_NAMESPACE_CLOSE_SCOPE PXR_NAMESPACE_OPEN_SCOPE
const SdfPath * operator->() const
SDF_API SdfPathAncestorsRange GetAncestorsRange() const
SDF_API SdfPath GetCommonPrefix(const SdfPath &path) const
SDF_API TfToken const & GetToken() const
SDF_API bool IsTargetPath() const
Sdf_PathNodeHandleImpl & operator=(Sdf_PathNodeHandleImpl const &rhs)
SDF_API std::pair< SdfPath, SdfPath > RemoveCommonSuffix(const SdfPath &otherPath, bool stopAtRootPrim=false) const
size_t hash_value(SdfPath const &path)
SDF_API bool IsRootPrimPath() const
SDF_API SdfPath AppendPath(const SdfPath &newSuffix) const
SDF_API std::string GetAsString() const
const SdfPath & GetPath() const
void intrusive_ptr_release(Sdf_PathNode const *)
SDF_API SdfPath MakeAbsolutePath(const SdfPath &anchor) const
#define PXR_NAMESPACE_CLOSE_SCOPE
SDF_API bool IsNamespacedPropertyPath() const
SDF_API SdfPath AppendElementToken(const TfToken &elementTok) const
Like AppendElementString() but take the element as a TfToken.
SDF_API SdfPath GetParentPath() const
static SDF_API SdfPathVector GetConciseRelativePaths(const SdfPathVector &paths)
SDF_API SdfPath GetPrimOrPrimVariantSelectionPath() const
SDF_API bool IsPropertyPath() const
static SDF_API std::pair< std::string, bool > StripPrefixNamespace(const std::string &name, const std::string &matchNamespace)
SDF_API friend char const * Sdf_PathGetDebuggerPathText(SdfPath const &)
SDF_API friend difference_type distance(const iterator &first, const iterator &last)
RandomAccessIterator SdfPathFindLongestPrefix(RandomAccessIterator begin, RandomAccessIterator end, SdfPath const &path, GetPathFn const &getPath=GetPathFn())
static SDF_API void RemoveAncestorPaths(SdfPathVector *paths)
SDF_API bool IsAbsoluteRootOrPrimPath() const
Returns whether the path identifies a prim or the absolute root.
RandomAccessIterator SdfPathFindLongestStrictPrefix(RandomAccessIterator begin, RandomAccessIterator end, SdfPath const &path, GetPathFn const &getPath=GetPathFn())
Sdf_PathNode const * operator->() const
Sdf_PathNodeHandleImpl(Sdf_PathNodeHandleImpl &&rhs) noexcept
SDF_API SdfPathVector GetPrefixes() const
static SDF_API std::string StripNamespace(const std::string &name)
SDF_API SdfPath ReplaceName(TfToken const &newName) const
static SDF_API const SdfPath & ReflexiveRelativePath()
The relative path representing "self".
SDF_API SdfPath AppendElementString(const std::string &element) const
bool operator()(const SdfPath &a, const SdfPath &b) const
VT_TYPE_IS_CHEAP_TO_COPY(class SdfPath)
std::ptrdiff_t difference_type
SDF_API SdfPath MakeRelativePath(const SdfPath &anchor) const
SDF_API SdfPath ReplacePrefix(const SdfPath &oldPrefix, const SdfPath &newPrefix, bool fixTargetPaths=true) const
SDF_API SdfPath GetPrimPath() const
GLenum const void * paths
static SDF_API TfTokenVector TokenizeIdentifierAsTokens(const std::string &name)
PcpNodeRef_ChildrenIterator begin(const PcpNodeRef::child_const_range &r)
Support for range-based for loops for PcpNodeRef children ranges.