42         fStrings = that.fStrings;  in operator =()
75     fStrings.reset();  in init()
96         fStrings.push_back_n(extensionCnt);  in init()
99             fStrings[i] = ext;  in init()
106         eat_space_sep_strings(&fStrings, extensions);  in init()
111         eat_space_sep_strings(&fStrings, extensions);  in init()
113     if (!fStrings.empty()) {  in init()
115         SkTQSort(&fStrings.front(), &fStrings.back(), cmp);  in init()
123     return find_string(fStrings, ext) >= 0;  in has()
128     int idx = find_string(fStrings, ext);  in remove()
135     fStrings.removeShuffle(idx);  in remove()
136     if (idx != fStrings.count()) {  in remove()
138         SkTInsertionSort(&(fStrings.operator[](idx)), &fStrings.back(), cmp);  in remove()
144     int idx = find_string(fStrings, ext);  in add()
148         fStrings.emplace_back(ext);  in add()
150         SkTInsertionSort(&fStrings.front(), &fStrings.back(), cmp);  in add()
157     for (int i = 0; i < fStrings.count(); ++i) {  in dumpJSON()
158         writer->appendString(fStrings[i].c_str());  in dumpJSON()