10 #ifndef __UT_StringArray_h__
11 #define __UT_StringArray_h__
64 void sort(
bool forward,
bool numbered);
76 template <
typename Compare>
81 bool numbered =
true);
83 template <
typename Compare>
93 bool numbered =
true)
const;
95 exint getLongestPrefixLength()
const;
105 void join(
const char *sep,
const char *sep_last,
111 unsigned hash()
const;
113 template <
typename I>
121 { return ::strcmp(myValues(a), myValues(b)) < 0; }
126 template <
typename I>
130 std::stable_sort(indices.
getArray(),
138 template <
typename T>
139 struct DefaultClearer;
150 static const bool clearNeedsDestruction =
false;
154 #endif // __UT_StringArray_h__
exint find(const T &t, exint s=0) const
bool operator()(I a, I b) const
exint sortedFind(const UT_StringRef &str, Comparator compare) const
UT_StringArray(const Parent &src)
GLboolean GLboolean GLboolean GLboolean a
GLint GLsizei const GLuint64 * values
static void clear(UT_StringArray &v)
void stdsort(ComparatorBool is_less)
Sort using std::sort. The ComparatorBool uses the less-than semantics.
OIIO_API bool remove(string_view path, std::string &err)
IndexedCompare(const UT_StringArray &values)
CompareResults OIIO_API compare(const ImageBuf &A, const ImageBuf &B, float failthresh, float warnthresh, ROI roi={}, int nthreads=0)
void setCapacity(exint newcapacity)
GLuint GLuint GLsizei GLenum const void * indices
SYS_FORCE_INLINE const UT_StringHolder & UTmakeUnsafeRef(const UT_StringRef &ref)
Convert a UT_StringRef into a UT_StringHolder that is a shallow reference.
void sort(Comparator compare)
exint sortedInsert(const T &t, Comparator compare)
UT_StringArray(Parent &&src) noexcept
GLdouble GLdouble GLdouble b
void stableSortIndices(UT_Array< I > &indices) const
FMT_CONSTEXPR bool find(Ptr first, Ptr last, T value, Ptr &out)
void sort(Comparator compare)
void sortedInsert(const char *str, Compare is_less)
static bool isClear(const UT_StringArray &v)
static void clearConstruct(UT_StringArray *p)
void sort(Compare is_less)
exint sortedFind(const T &t, Comparator compare) const