Lines Matching refs:strings
145 bufferCapacity(0), patLen(0), pat(NULL), strings(NULL), stringSpan(NULL),
172 bufferCapacity(0), patLen(0), pat(NULL), strings(NULL), stringSpan(NULL),
199 patLen(0), pat(NULL), strings(NULL), stringSpan(NULL),
223 patLen(0), pat(NULL), strings(NULL), stringSpan(NULL),
236 if (strings != NULL && o.strings != NULL) {
237 strings->assign(*o.strings, cloneUnicodeString, status);
238 } else { // Invalid strings.
262 delete strings;
297 if (strings != NULL && o.strings != NULL) {
298 strings->assign(*o.strings, cloneUnicodeString, ec);
299 } else { // Invalid strings.
306 stringSpan = new UnicodeSetStringSpan(*o.stringSpan, *strings);
347 if (*strings != *o.strings) return FALSE;
373 * codepoints and strings.
383 return n + strings->size();
392 return len == 1 && strings->size() == 0;
492 return strings->contains((void*) &s);
499 * Returns true if this set contains all the characters and strings
514 if (!strings->containsAll(*c.strings)) return FALSE;
546 * Returns true if this set contains none of the characters and strings
561 if (!strings->containsNone(*c.strings)) return FALSE;
603 if (strings->size() != 0) {
604 for (i=0; i<strings->size(); ++i) {
605 const UnicodeString& s = *(const UnicodeString*)strings->elementAt(i);
607 // // Empty strings match everything
629 // Strings, if any, have length != 0, so we don't worry
630 // about them here. If we ever allow zero-length strings
638 if (strings->size() != 0) { // try strings first
645 // can assume the strings are sorted.
655 // If there are multiple strings that can match we
659 for (i=0; i<strings->size(); ++i) {
660 const UnicodeString& trial = *(const UnicodeString*)strings->elementAt(i);
669 // Strings are sorted, so we can optimize in the
689 // In the forward direction we know strings
698 // We've checked all strings without a partial match.
1002 if (!strings->contains((void*) &s)) {
1013 * Adds the given string, in order, to 'strings'. The given string
1015 * already be in 'strings'.
1027 strings->sortedInsert(t, compareUnicodeString, ec);
1041 // throw new IllegalArgumentException("Can't use zero-length strings in UnicodeSet");
1109 strings->removeAllElements();
1205 strings->removeElement((void*) &s);
1282 if (strings->contains((void*) &s)) {
1283 strings->removeElement((void*) &s);
1309 // Add strings in order
1310 if ( c.strings!=NULL ) {
1311 for (int32_t i=0; i<c.strings->size(); ++i) {
1312 const UnicodeString* s = (const UnicodeString*)c.strings->elementAt(i);
1313 if (!strings->contains((void*) s)) {
1335 strings->retainAll(*c.strings);
1353 strings->removeAll(*c.strings);
1371 for (int32_t i=0; i<c.strings->size(); ++i) {
1372 void* e = c.strings->elementAt(i);
1373 if (!strings->removeElement(e)) {
1393 if (strings != NULL) {
1394 strings->removeAllElements();
1396 if (list != NULL && strings != NULL) {
1434 return strings->size();
1438 return (const UnicodeString*) strings->elementAt(index);
1555 * Allocate our strings vector and return TRUE if successful.
1561 strings = new UVector(uhash_deleteUnicodeString,
1563 if (strings == NULL) { // Check for memory allocation error.
1568 delete strings;
1569 strings = NULL;
2048 for (int32_t i = 0; i<strings->size(); ++i) {
2051 *(const UnicodeString*) strings->elementAt(i),
2108 if (!strings->isEmpty()) {
2109 stringSpan = new UnicodeSetStringSpan(*this, *strings, UnicodeSetStringSpan::ALL);
2111 // All strings are irrelevant for span() etc. because
2114 // many relevant strings as UTF-16.
2121 // No span-relevant strings: Optimize for code point spans.
2143 } else if(!strings->isEmpty()) {
2147 UnicodeSetStringSpan strSpan(*this, *strings, which);
2180 } else if(!strings->isEmpty()) {
2184 UnicodeSetStringSpan strSpan(*this, *strings, which);
2218 } else if(!strings->isEmpty()) {
2222 UnicodeSetStringSpan strSpan(*this, *strings, which);
2259 } else if(!strings->isEmpty()) {
2263 UnicodeSetStringSpan strSpan(*this, *strings, which);
