| /external/chromium_org/chrome/common/ |
| autocomplete_match_type.cc | 11 const char* strings[] = { local
26 COMPILE_ASSERT(arraysize(strings) == AutocompleteMatchType::NUM_TYPES,
28 return strings[type];
|
| /external/chromium_org/v8/test/intl/collator/ |
| de-sort.js | 30 var strings = ['März', 'Fuße', 'FUSSE', 'Fluße', 'Flusse', variable
34 var result = strings.sort(collator.compare);
|
| en-sort.js | 30 var strings = ['blood', 'bull', 'ascend', 'zed', 'down']; variable
33 var result = strings.sort(collator.compare);
|
| sr-sort.js | 30 var strings = ['??????', '??????', '??????', '??????', '???????', variable
34 var result = strings.sort(collator.compare);
|
| /external/lzma/CPP/7zip/UI/Common/ |
| SortUtils.cpp | 10 const UStringVector &strings = *(const UStringVector *)param;
local
11 return CompareFileNames(strings[*p1], strings[*p2]);
14 void SortFileNames(const UStringVector &strings, CIntVector &indices)
17 int numItems = strings.Size();
21 indices.Sort(CompareStrings, (void *)&strings);
|
| /frameworks/native/opengl/tools/glgen/stubs/gles11/ |
| glShaderSource.cpp | 14 const char* strings[] = {nativeString}; local
15 glShaderSource(shader, 1, strings, 0);
|
| /external/chromium/chrome/browser/sync/ |
| sync_ui_util_unittest.cc | 19 DictionaryValue strings; local
38 sync_ui_util::ConstructAboutInformation(&service, &strings);
40 EXPECT_TRUE(strings.HasKey("unrecoverable_error_detected"));
|
| /libnativehelper/ |
| toStringArray.cpp | 28 const std::vector<std::string>& strings; member in struct:VectorCounter
29 VectorCounter(const std::vector<std::string>& strings) : strings(strings) {}
31 return strings.size();
35 const std::vector<std::string>& strings; member in struct:VectorGetter
36 VectorGetter(const std::vector<std::string>& strings) : strings(strings) {}
38 return strings[i].c_str()
49 const char* const* strings; member in struct:ArrayCounter
61 const char* const* strings; member in struct:ArrayGetter
[all...] |
| /dalvik/dx/src/com/android/dx/dex/file/ |
| StringIdsSection.java | 28 * Strings list section of a {@code .dex} file.
36 private final TreeMap<CstString, StringIdItem> strings; field in class:StringIdsSection
46 strings = new TreeMap<CstString, StringIdItem>();
52 return strings.values();
64 IndexedItem result = strings.get((CstString) cst);
81 int sz = strings.size();
128 StringIdItem already = strings.get(value);
134 strings.put(value, string);
162 StringIdItem s = strings.get(string);
176 for (StringIdItem s : strings.values())
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/dex/file/ |
| StringIdsSection.java | 29 * Strings list section of a {@code .dex} file.
37 private final TreeMap<CstString, StringIdItem> strings; field in class:StringIdsSection
47 strings = new TreeMap<CstString, StringIdItem>();
53 return strings.values();
65 IndexedItem result = strings.get((CstString) cst);
82 int sz = strings.size();
129 StringIdItem already = strings.get(value);
135 strings.put(value, string);
163 StringIdItem s = strings.get(string);
177 for (StringIdItem s : strings.values())
[all...] |
| /art/runtime/mirror/ |
| dex_cache.cc | 36 ObjectArray<String>* strings,
43 CHECK(strings != NULL);
51 SetFieldObject(StringsOffset(), strings, false); local
|
| /art/runtime/ |
| utils_test.cc | 287 std::vector<std::string> strings; local
289 strings.clear();
290 EXPECT_EQ("", Join(strings, ':'));
292 strings.clear();
293 strings.push_back("foo");
294 EXPECT_EQ("foo", Join(strings, ':'));
296 strings.clear();
297 strings.push_back("");
298 strings.push_back("foo");
299 EXPECT_EQ(":foo", Join(strings, ':'))
[all...] |
| /external/chromium/chrome/browser/autocomplete/ |
| autocomplete_match.cc | 45 const char* strings[NUM_TYPES] = { local
58 DCHECK(arraysize(strings) == NUM_TYPES);
59 return strings[type];
|
| /external/chromium_org/third_party/WebKit/Source/web/ |
| WebIDBKeyPath.cpp | 45 Vector<String> strings; local
47 strings.append(keyPath[i]);
48 return WebIDBKeyPath(IDBKeyPath(strings));
|
| /external/chromium_org/third_party/ots/src/ |
| post.cc | 41 // We have a version 2 table with a list of Pascal strings at the end
85 // Now we have an array of Pascal strings. We have to check that they are all
88 const uint8_t *strings = data + strings_offset; local
92 if (strings == strings_end) break;
93 const unsigned string_length = *strings;
94 if (strings + 1 + string_length > strings_end) {
97 if (std::memchr(strings + 1, '\0', string_length)) {
101 std::string(reinterpret_cast<const char*>(strings + 1), string_length));
102 strings += 1 + string_length;
160 // Now we just have to write out the strings in the correct orde
[all...] |
| /external/chromium_org/third_party/protobuf/src/google/protobuf/stubs/ |
| substitute.cc | 39 namespace strings { namespace in namespace:google::protobuf
85 << "strings::Substitute format string invalid: asked for \"$"
98 << "Invalid strings::Substitute() format string: \""
132 } // namespace strings
|
| substitute.h | 32 // from google3/strings/substitute.h
43 namespace strings { namespace in namespace:google::protobuf
46 // strings::Substitute()
47 // strings::SubstituteAndAppend()
52 // return strings::Substitute("My name is $0 $1 and I am $2 years old.",
66 // * Strings (const char*, const string&)
68 // your strings. In fact, you shouldn't; it will be slower.
77 // strings::SubstituteAndAppend(&str,
82 // large strings, it may be orders of magnitude faster.
166 } // namespace strings
[all...] |
| /external/chromium_org/tools/gn/ |
| tokenizer_unittest.cc | 69 TokenExpectation strings[] = { local
75 strings));
|
| /external/chromium_org/tools/json_schema_compiler/test/ |
| choices_unittest.cc | 7 #include "base/strings/string_piece.h"
47 Dictionary("strings", new base::StringValue("asdf")).release())));
49 EXPECT_FALSE(params->string_info.strings.as_strings);
50 EXPECT_EQ("asdf", *params->string_info.strings.as_string);
56 Dictionary("strings", new base::StringValue("asdf"),
59 EXPECT_FALSE(params->string_info.strings.as_strings);
60 EXPECT_EQ("asdf", *params->string_info.strings.as_string);
73 object_param->SetWithoutPathExpansion("strings",
83 object_param->SetWithoutPathExpansion("strings",
106 std::vector<std::string> strings = Vector(std::string("list") local
[all...] |
| /external/icu4c/common/unicode/ |
| bytestriebuilder.h | 163 CharString *strings; // Pointer not object so we need not #include internal charstr.h. member in class:BytesTrieBuilder
|
| ucharstriebuilder.h | 117 strings.remove();
167 UnicodeString strings; member in class:UCharsTrieBuilder
|
| /external/icu4c/test/intltest/ |
| colldata.h | 174 * @return the number of strings in the list.
179 UnicodeString *strings; member in class:StringList
231 * Get a list of all the strings which generate a list
238 * no such strings.
|
| /external/protobuf/src/google/protobuf/stubs/ |
| substitute.cc | 39 namespace strings { namespace in namespace:google::protobuf
85 << "strings::Substitute format string invalid: asked for \"$"
98 << "Invalid strings::Substitute() format string: \""
132 } // namespace strings
|
| substitute.h | 32 // from google3/strings/substitute.h
43 namespace strings { namespace in namespace:google::protobuf
46 // strings::Substitute()
47 // strings::SubstituteAndAppend()
52 // return strings::Substitute("My name is $0 $1 and I am $2 years old.",
66 // * Strings (const char*, const string&)
68 // your strings. In fact, you shouldn't; it will be slower.
77 // strings::SubstituteAndAppend(&str,
82 // large strings, it may be orders of magnitude faster.
166 } // namespace strings
[all...] |
| /external/stlport/test/unit/ |
| istmit_test.cpp | 101 vector<string> strings; local
109 copy_n(istream_string_ite(istr), 2, back_inserter(strings));
110 CPPUNIT_ASSERT( strings.size() == 2 );
111 CPPUNIT_ASSERT( strings[0] == "AA" );
112 CPPUNIT_ASSERT( strings[1] == "BB" );
113 strings.clear();
123 * again it fails as int can be converted to strings.
130 copy_n(istream_string_ite(istr), 2, back_inserter(strings));
131 CPPUNIT_ASSERT( strings.size() == 2 );
132 CPPUNIT_ASSERT( strings[0] == "CC" )
[all...] |
