Searched refs:strings (Results 151 - 175 of 863) sorted by relevance

1234567891011>>

/external/chromium_org/chrome/browser/ui/views/autofill/
H A Dexpanding_textfield.cc8 #include "base/strings/string_split.h"
9 #include "base/strings/string_util.h"
10 #include "base/strings/utf_string_conversions.h"
53 std::vector<base::string16> strings; local
54 base::SplitStringDontTrim(text, '\n', &strings);
59 (*iter)->SetText(i < strings.size() ? strings[i++] : base::string16());
62 for (; i < strings.size(); ++i) {
64 strings[i],
/external/chromium_org/components/autofill/core/common/
H A Dform_field_data.cc8 #include "base/strings/string_util.h"
9 #include "base/strings/utf_string_conversions.h"
15 void AddVectorToPickle(std::vector<base::string16> strings, argument
17 pickle->WriteInt(static_cast<int>(strings.size()));
18 for (size_t i = 0; i < strings.size(); ++i) {
19 pickle->WriteString16(strings[i]);
24 std::vector<base::string16>* strings) {
34 strings->push_back(pickle_data);
23 ReadStringVector(PickleIterator* iter, std::vector<base::string16>* strings) argument
/external/chromium_org/third_party/icu/source/common/
H A Dusetiter.cpp43 * <br>You are guaranteed that the codepoints are in sorted order, and the strings are in sorted order,
44 * and that all code points are returned before any strings are returned.
62 string = (const UnicodeString*) set->strings->elementAt(nextString++);
70 * <br>Note that the codepoints are in sorted order, and the strings are in sorted order,
71 * and that all code points are returned before any strings are returned.
72 * <br>You are guaranteed that the ranges are in sorted order, and the strings are in sorted order,
73 * and that all ranges are returned before any strings are returned.
95 string = (const UnicodeString*) set->strings->elementAt(nextString++);
117 stringCount = set->strings->size();
H A Duniset_closure.cpp52 bufferCapacity(0), patLen(0), pat(NULL), strings(NULL), stringSpan(NULL),
73 bufferCapacity(0), patLen(0), pat(NULL), strings(NULL), stringSpan(NULL),
199 // USET_CASE: remove strings because the strings will actually be reduced (folded);
200 // therefore, start with no strings and add only those needed
202 foldSet.strings->removeAllElements();
237 if (strings != NULL && strings->size() > 0) {
239 for (int32_t j=0; j<strings->size(); ++j) {
240 str = *(const UnicodeString *) strings
[all...]
/external/chromium_org/tools/gyp/test/mac/
H A Dgyptest-app.py75 strings_files = ['InfoPlist.strings', 'utf-16be.strings', 'utf-16le.strings']
77 strings = test.built_file_path( variable
80 test.must_exist(strings)
82 contents = open(strings, 'rb').read()
/external/icu/icu4c/source/common/
H A Dusetiter.cpp43 * <br>You are guaranteed that the codepoints are in sorted order, and the strings are in sorted order,
44 * and that all code points are returned before any strings are returned.
62 string = (const UnicodeString*) set->strings->elementAt(nextString++);
70 * <br>Note that the codepoints are in sorted order, and the strings are in sorted order,
71 * and that all code points are returned before any strings are returned.
72 * <br>You are guaranteed that the ranges are in sorted order, and the strings are in sorted order,
73 * and that all ranges are returned before any strings are returned.
95 string = (const UnicodeString*) set->strings->elementAt(nextString++);
117 stringCount = set->strings->size();
H A Duniset_closure.cpp52 bufferCapacity(0), patLen(0), pat(NULL), strings(NULL), stringSpan(NULL),
73 bufferCapacity(0), patLen(0), pat(NULL), strings(NULL), stringSpan(NULL),
199 // USET_CASE: remove strings because the strings will actually be reduced (folded);
200 // therefore, start with no strings and add only those needed
202 foldSet.strings->removeAllElements();
237 if (strings != NULL && strings->size() > 0) {
239 for (int32_t j=0; j<strings->size(); ++j) {
240 str = *(const UnicodeString *) strings
[all...]
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/debug/
H A Drecord-event-listener.rb9 A debug listener that records intercepted events as strings in an array.
/external/chromium_org/third_party/angle/src/common/
H A Dangleutils.h100 static std::set<std::string> strings; local
101 std::set<std::string>::iterator it = strings.find(str);
102 if (it != strings.end())
107 return strings.insert(str).first->c_str();
/external/chromium_org/third_party/skia/src/gpu/gl/
H A DGrGLExtensions.cpp21 // finds the index of ext in strings or a negative result if ext is not found.
22 static int find_string(const SkTArray<SkString>& strings, const char ext[]) { argument
23 if (strings.empty()) {
27 int idx = SkTSearch<SkString, extension_compare>(&strings.front(),
28 strings.count(),
/external/lldb/include/lldb/API/
H A DSBStringList.h40 AppendList (const lldb::SBStringList &strings);
/external/qemu/android/utils/
H A Dmisc.h23 ** prints a list of strings in row/column format
27 extern void print_tabular( const char** strings, int count,
32 ** converts one character into another in strings
/external/skia/src/gpu/gl/
H A DGrGLExtensions.cpp21 // finds the index of ext in strings or a negative result if ext is not found.
22 static int find_string(const SkTArray<SkString>& strings, const char ext[]) { argument
23 if (strings.empty()) {
27 int idx = SkTSearch<SkString, extension_compare>(&strings.front(),
28 strings.count(),
/external/chromium_org/tools/json_schema_compiler/test/
H A Dchoices_unittest.cc7 #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 local
[all...]
/external/icu/icu4c/source/test/intltest/
H A Dcolldata.cpp170 : strings(NULL), listMax(STRING_LIST_BUFFER_SIZE), listSize(0)
176 strings = new UnicodeString [listMax];
178 if (strings == NULL) {
186 delete[] strings;
202 newStrings[i] = strings[i];
204 delete[] strings;
205 strings = newStrings;
209 // The ctor initialized all the strings in
210 // the array to empty strings, so this
212 strings[listSiz
241 StringList *strings = (StringList *) obj; local
286 StringList *strings = getStringList(ce); local
517 const StringList *strings = ceToCharsStartingWith->getStringList(ce); local
[all...]
/external/chromium_org/chrome/browser/ui/pdf/
H A Dpdf_unsupported_feature.cc9 #include "base/strings/utf_string_conversions.h"
166 base::DictionaryValue strings; variable
167 strings.SetString(
170 strings.SetString(
173 strings.SetString(
176 strings.SetString(
180 strings.SetString(
183 strings.SetString(
190 return webui::GetI18nTemplateHtml(html, &strings);
/external/chromium_org/native_client_sdk/src/libraries/xray/
H A Dstringpool.c8 /* String pool holds a large pile of strings. */
23 char strings[XRAY_STRING_POOL_NODE_SIZE]; member in struct:XRayStringPoolNode
50 /* Add +1 to STRING_POOL_NODE_SIZE to detect large strings */
55 /* Don't accept strings larger than the pool node. */
65 dst = &pool->current->strings[pool->index];
/external/chromium_org/third_party/skia/tools/flags/
H A DSkCommandLineFlags.cpp314 bool ShouldSkipImpl(const Strings& strings, const char* name) { argument
315 int count = strings.count();
318 for (int i = 0; i < strings.count(); ++i) {
319 const char* matchName = strings[i];
347 bool SkCommandLineFlags::ShouldSkip(const SkTDArray<const char*>& strings, const char* name) { argument
348 return ShouldSkipImpl(strings, name);
350 bool SkCommandLineFlags::ShouldSkip(const StringArray& strings, const char* name) { argument
351 return ShouldSkipImpl(strings, name);
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/objfmts/rdf/tests/
H A Dtestlib.asm17 string1: db 'abc',0 ; try changing these strings and see
/external/clang/test/SemaCXX/
H A Dflexible-array-test.cpp44 S strings[]; member in struct:X
50 return x.strings[0];
/external/lldb/include/lldb/Core/
H A DStringList.h46 AppendList (StringList strings);
86 operator << (StringList strings);
89 // strings, and the "s" is passed in. "matches" is filled in
/external/yaffs2/
H A DAndroid.mk13 LOCAL_CFLAGS+= -Wshadow -Wpointer-arith -Wwrite-strings -Wstrict-prototypes -Wmissing-declarations
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/
H A DCTarget.java39 ArrayList strings = new ArrayList(); field in class:CTarget
51 outputFileST.add("literals", strings);
65 // to it as we cannot assign into strings in Java.
210 // invalid strings if not, which is what the input would be of course - invalid
263 index = strings.indexOf(bytes);
266 strings.add(bytes);
267 index = strings.indexOf(bytes);
/external/jarjar/src/main/com/tonicsystems/jarjar/
H A DWildcard.java34 private final String[] strings; field in class:Wildcard
82 strings = new String[size];
88 strings[i] = ((String)v).replace('.', '/');
106 for (int i = 0; i < strings.length; i++)
107 sb.append((refs[i] >= 0) ? matcher.group(refs[i]) : strings[i]);
/external/lzma/CPP/7zip/UI/Common/
H A DUpdatePair.cpp55 static void TestDuplicateString(const UStringVector &strings, const CIntVector &indices) argument
58 if (CompareFileNames(strings[indices[i]], strings[indices[i + 1]]) == 0)
59 ThrowError(kDuplicateFileNameMessage, strings[indices[i]], strings[indices[i + 1]]);

Completed in 2489 milliseconds

1234567891011>>