|
| void | TfDelegatedCountIncrement (Sdf_PathNode const *) noexcept |
| |
| void | TfDelegatedCountDecrement (Sdf_PathNode const *) noexcept |
| |
| | VT_TYPE_IS_CHEAP_TO_COPY (class SdfPath) |
| |
| size_t | hash_value (SdfPath const &path) |
| |
| SDF_API std::ostream & | operator<< (std::ostream &out, const SdfPath &path) |
| | Writes the string representation of path to out. More...
|
| |
| template<class ForwardIterator , class GetPathFn = Sdf_PathIdentity> |
std::pair< ForwardIterator,
ForwardIterator > | SdfPathFindPrefixedRange (ForwardIterator begin, ForwardIterator end, SdfPath const &prefix, GetPathFn const &getPath=GetPathFn()) |
| |
| template<class RandomAccessIterator , class GetPathFn > |
| RandomAccessIterator | Sdf_PathFindLongestPrefixImpl (RandomAccessIterator begin, RandomAccessIterator end, SdfPath const &path, bool strictPrefix, GetPathFn const &getPath) |
| |
| template<class RandomAccessIterator , class GetPathFn = Sdf_PathIdentity, class = typename std::enable_if< std::is_base_of< std::random_access_iterator_tag, typename std::iterator_traits< RandomAccessIterator>::iterator_category >::value >::type> |
| RandomAccessIterator | SdfPathFindLongestPrefix (RandomAccessIterator begin, RandomAccessIterator end, SdfPath const &path, GetPathFn const &getPath=GetPathFn()) |
| |
| template<class RandomAccessIterator , class GetPathFn = Sdf_PathIdentity, class = typename std::enable_if< std::is_base_of< std::random_access_iterator_tag, typename std::iterator_traits< RandomAccessIterator>::iterator_category >::value >::type> |
| RandomAccessIterator | SdfPathFindLongestStrictPrefix (RandomAccessIterator begin, RandomAccessIterator end, SdfPath const &path, GetPathFn const &getPath=GetPathFn()) |
| |
| template<class Iter , class MapParam , class GetPathFn = Sdf_PathIdentity> |
| Iter | Sdf_PathFindLongestPrefixImpl (MapParam map, SdfPath const &path, bool strictPrefix, GetPathFn const &getPath=GetPathFn()) |
| |
SDF_API std::set< SdfPath >
::const_iterator | SdfPathFindLongestPrefix (std::set< SdfPath > const &set, SdfPath const &path) |
| |
| template<class T > |
std::map< SdfPath, T >
::const_iterator | SdfPathFindLongestPrefix (std::map< SdfPath, T > const &map, SdfPath const &path) |
| |
| template<class T > |
| std::map< SdfPath, T >::iterator | SdfPathFindLongestPrefix (std::map< SdfPath, T > &map, SdfPath const &path) |
| |
SDF_API std::set< SdfPath >
::const_iterator | SdfPathFindLongestStrictPrefix (std::set< SdfPath > const &set, SdfPath const &path) |
| |
| template<class T > |
std::map< SdfPath, T >
::const_iterator | SdfPathFindLongestStrictPrefix (std::map< SdfPath, T > const &map, SdfPath const &path) |
| |
| template<class T > |
| std::map< SdfPath, T >::iterator | SdfPathFindLongestStrictPrefix (std::map< SdfPath, T > &map, SdfPath const &path) |
| |
| SDF_API char const * | Sdf_PathGetDebuggerPathText (SdfPath const &) |
| |
template<class RandomAccessIterator , class GetPathFn = Sdf_PathIdentity, class = typename std::enable_if< std::is_base_of< std::random_access_iterator_tag, typename std::iterator_traits< RandomAccessIterator>::iterator_category >::value >::type>
| RandomAccessIterator SdfPathFindLongestPrefix |
( |
RandomAccessIterator |
begin, |
|
|
RandomAccessIterator |
end, |
|
|
SdfPath const & |
path, |
|
|
GetPathFn const & |
getPath = GetPathFn() |
|
) |
| |
Return an iterator to the element of [begin, end) that is the longest prefix of the given path (including the path itself), if there is such an element, otherwise end. The input range must be ordered according to SdfPath::operator<. If your range's iterators' value_types are not SdfPath, but you can obtain SdfPaths from them (e.g. vector<pair<SdfPath, X>>::iterator), you can pass a function to extract the path from the dereferenced iterator in getPath.
Definition at line 1268 of file path.h.
template<class RandomAccessIterator , class GetPathFn = Sdf_PathIdentity, class = typename std::enable_if< std::is_base_of< std::random_access_iterator_tag, typename std::iterator_traits< RandomAccessIterator>::iterator_category >::value >::type>
| RandomAccessIterator SdfPathFindLongestStrictPrefix |
( |
RandomAccessIterator |
begin, |
|
|
RandomAccessIterator |
end, |
|
|
SdfPath const & |
path, |
|
|
GetPathFn const & |
getPath = GetPathFn() |
|
) |
| |
Return an iterator to the element of [begin, end) that is the longest prefix of the given path (excluding the path itself), if there is such an element, otherwise end. The input range must be ordered according to SdfPath::operator<. If your range's iterators' value_types are not SdfPath, but you can obtain SdfPaths from them (e.g. vector<pair<SdfPath, X>>::iterator), you can pass a function to extract the path from the dereferenced iterator in getPath.
Definition at line 1294 of file path.h.
template<class ForwardIterator , class GetPathFn = Sdf_PathIdentity>
| std::pair<ForwardIterator, ForwardIterator> SdfPathFindPrefixedRange |
( |
ForwardIterator |
begin, |
|
|
ForwardIterator |
end, |
|
|
SdfPath const & |
prefix, |
|
|
GetPathFn const & |
getPath = GetPathFn() |
|
) |
| |
Find the subrange of the sorted range [begin, end) that includes all paths prefixed by path. The input range must be ordered according to SdfPath::operator<. If your range's iterators' value_types are not SdfPath, but you can obtain SdfPaths from them (e.g. map<SdfPath, X>::iterator), you can pass a function to extract the path from the dereferenced iterator in getPath.
Definition at line 1151 of file path.h.