X-Git-Url: https://git.saurik.com/android/aapt.git/blobdiff_plain/34ceac879a88aac0117323712ee67fad79a561bd..86001ed2bff0362b580bb1d977e7bf6f9a93815b:/StringPool.h?ds=sidebyside diff --git a/StringPool.h b/StringPool.h index 86044ed..d501008 100644 --- a/StringPool.h +++ b/StringPool.h @@ -13,6 +13,7 @@ #include #include #include +#include #include #include @@ -79,16 +80,10 @@ public: }; /** - * If 'sorted' is true, then the final strings in the resource data - * structure will be generated in sorted order. This allow for fast - * lookup with ResStringPool::indexOfString() (O(log n)), at the expense - * of support for styled string entries (which requires the same string - * be included multiple times in the pool). - * * If 'utf8' is true, strings will be encoded with UTF-8 instead of * left in Java's native UTF-16. */ - explicit StringPool(bool sorted = false, bool utf8 = false); + explicit StringPool(bool utf8 = false); /** * Add a new string to the pool. If mergeDuplicates is true, thenif @@ -96,9 +91,7 @@ public: * otherwise, or if the value doesn't already exist, a new entry is * created. * - * Returns the index in the entry array of the new string entry. Note that - * if this string pool is sorted, the returned index will not be valid - * when the pool is finally written. + * Returns the index in the entry array of the new string entry. */ ssize_t add(const String16& value, bool mergeDuplicates = false, const String8* configTypeName = NULL, const ResTable_config* config = NULL); @@ -106,24 +99,14 @@ public: ssize_t add(const String16& value, const Vector& spans, const String8* configTypeName = NULL, const ResTable_config* config = NULL); - ssize_t add(const String16& ident, const String16& value, - bool mergeDuplicates = false, - const String8* configTypeName = NULL, const ResTable_config* config = NULL); - status_t addStyleSpan(size_t idx, const String16& name, uint32_t start, uint32_t end); status_t addStyleSpans(size_t idx, const Vector& spans); status_t addStyleSpan(size_t idx, const entry_style_span& span); - size_t size() const; - - const entry& entryAt(size_t idx) const; - - size_t countIdentifiers() const; - // Sort the contents of the string block by the configuration associated // with each item. After doing this you can use mapOriginalPosToNewPos() - // to find out the new position given the position originall returned by + // to find out the new position given the position originally returned by // add(). void sortByConfig(); @@ -156,9 +139,8 @@ public: const Vector* offsetsForString(const String16& val) const; private: - static int config_sort(const size_t* lhs, const size_t* rhs, void* state); + static int config_sort(void* state, const void* lhs, const void* rhs); - const bool mSorted; const bool mUTF8; // The following data structures represent the actual structures @@ -185,13 +167,18 @@ private: // Unique set of all the strings added to the pool, mapped to // the first index of mEntryArray where the value was added. DefaultKeyedVector mValues; - // Unique set of all (optional) identifiers of strings in the - // pool, mapping to indices in mEntries. - DefaultKeyedVector mIdents; // This array maps from the original position a string was placed at // in mEntryArray to its new position after being sorted with sortByConfig(). Vector mOriginalPosToNewPos; }; +// The entry types are trivially movable because all fields they contain, including +// the vectors and strings, are trivially movable. +namespace android { + ANDROID_TRIVIAL_MOVE_TRAIT(StringPool::entry); + ANDROID_TRIVIAL_MOVE_TRAIT(StringPool::entry_style_span); + ANDROID_TRIVIAL_MOVE_TRAIT(StringPool::entry_style); +}; + #endif