Lines Matching full:strings
147 bufferCapacity(0), patLen(0), pat(NULL), strings(NULL), stringSpan(NULL),
174 bufferCapacity(0), patLen(0), pat(NULL), strings(NULL), stringSpan(NULL),
201 patLen(0), pat(NULL), strings(NULL), stringSpan(NULL),
225 patLen(0), pat(NULL), strings(NULL), stringSpan(NULL),
238 if (strings != NULL && o.strings != NULL) {
239 strings->assign(*o.strings, cloneUnicodeString, status);
240 } else { // Invalid strings.
264 delete strings;
299 if (strings != NULL && o.strings != NULL) {
300 strings->assign(*o.strings, cloneUnicodeString, ec);
301 } else { // Invalid strings.
308 stringSpan = new UnicodeSetStringSpan(*o.stringSpan, *strings);
349 if (*strings != *o.strings) return FALSE;
375 * codepoints and strings.
385 return n + strings->size();
394 return len == 1 && strings->size() == 0;
494 return strings->contains((void*) &s);
501 * Returns true if this set contains all the characters and strings
516 if (!strings->containsAll(*c.strings)) return FALSE;
548 * Returns true if this set contains none of the characters and strings
563 if (!strings->containsNone(*c.strings)) return FALSE;
605 if (strings->size() != 0) {
606 for (i=0; i<strings->size(); ++i) {
607 const UnicodeString& s = *(const UnicodeString*)strings->elementAt(i);
609 // // Empty strings match everything
631 // Strings, if any, have length != 0, so we don't worry
632 // about them here. If we ever allow zero-length strings
640 if (strings->size() != 0) { // try strings first
647 // can assume the strings are sorted.
657 // If there are multiple strings that can match we
661 for (i=0; i<strings->size(); ++i) {
662 const UnicodeString& trial = *(const UnicodeString*)strings->elementAt(i);
671 // Strings are sorted, so we can optimize in the
691 // In the forward direction we know strings
700 // We've checked all strings without a partial match.
1004 if (!strings->contains((void*) &s)) {
1015 * Adds the given string, in order, to 'strings'. The given string
1017 * already be in 'strings'.
1029 strings->sortedInsert(t, compareUnicodeString, ec);
1043 // throw new IllegalArgumentException("Can't use zero-length strings in UnicodeSet");
1111 strings->removeAllElements();
1207 strings->removeElement((void*) &s);
1284 if (strings->contains((void*) &s)) {
1285 strings->removeElement((void*) &s);
1311 // Add strings in order
1312 if ( c.strings!=NULL ) {
1313 for (int32_t i=0; i<c.strings->size(); ++i) {
1314 const UnicodeString* s = (const UnicodeString*)c.strings->elementAt(i);
1315 if (!strings->contains((void*) s)) {
1337 strings->retainAll(*c.strings);
1355 strings->removeAll(*c.strings);
1373 for (int32_t i=0; i<c.strings->size(); ++i) {
1374 void* e = c.strings->elementAt(i);
1375 if (!strings->removeElement(e)) {
1395 if (strings != NULL) {
1396 strings->removeAllElements();
1398 if (list != NULL && strings != NULL) {
1436 return strings->size();
1440 return (const UnicodeString*) strings->elementAt(index);
1557 * Allocate our strings vector and return TRUE if successful.
1563 strings = new UVector(uprv_deleteUObject,
1565 if (strings == NULL) { // Check for memory allocation error.
1570 delete strings;
1571 strings = NULL;
2050 for (int32_t i = 0; i<strings->size(); ++i) {
2053 *(const UnicodeString*) strings->elementAt(i),
2110 if (!strings->isEmpty()) {
2111 stringSpan = new UnicodeSetStringSpan(*this, *strings, UnicodeSetStringSpan::ALL);
2113 // All strings are irrelevant for span() etc. because
2116 // many relevant strings as UTF-16.
2123 // No span-relevant strings: Optimize for code point spans.
2145 } else if(!strings->isEmpty()) {
2149 UnicodeSetStringSpan strSpan(*this, *strings, which);
2182 } else if(!strings->isEmpty()) {
2186 UnicodeSetStringSpan strSpan(*this, *strings, which);
2220 } else if(!strings->isEmpty()) {
2224 UnicodeSetStringSpan strSpan(*this, *strings, which);
2258 } else if(!strings->isEmpty()) {
2262 UnicodeSetStringSpan strSpan(*this, *strings, which);
