Lines Matching refs:m_search_
28 m_search_ = (USearch *)uprv_malloc(sizeof(USearch));
29 m_search_->breakIter = other.m_search_->breakIter;
30 m_search_->isCanonicalMatch = other.m_search_->isCanonicalMatch;
31 m_search_->isOverlap = other.m_search_->isOverlap;
32 m_search_->elementComparisonType = other.m_search_->elementComparisonType;
33 m_search_->matchedIndex = other.m_search_->matchedIndex;
34 m_search_->matchedLength = other.m_search_->matchedLength;
35 m_search_->text = other.m_search_->text;
36 m_search_->textLength = other.m_search_->textLength;
41 if (m_search_ != NULL) {
42 uprv_free(m_search_);
56 m_search_->isOverlap = (value == USEARCH_ON ? TRUE : FALSE);
59 m_search_->isCanonicalMatch = (value == USEARCH_ON ? TRUE : FALSE);
63 m_search_->elementComparisonType = (int16_t)value;
65 m_search_->elementComparisonType = 0;
82 return (m_search_->isOverlap == TRUE ? USEARCH_ON : USEARCH_OFF);
84 return (m_search_->isCanonicalMatch == TRUE ? USEARCH_ON :
88 int16_t value = m_search_->elementComparisonType;
102 return m_search_->matchedIndex;
107 return m_search_->matchedLength;
112 int32_t matchedindex = m_search_->matchedIndex;
113 int32_t matchedlength = m_search_->matchedLength;
115 result.setTo(m_search_->text + matchedindex, matchedlength);
127 m_search_->breakIter = NULL;
138 m_search_->breakIter = (UBreakIterator *) breakiter;
158 m_search_->text = m_text_.getBuffer();
159 m_search_->textLength = m_text_.length();
185 m_search_->isCanonicalMatch == that.m_search_->isCanonicalMatch &&
186 m_search_->isOverlap == that.m_search_->isOverlap &&
187 m_search_->elementComparisonType == that.m_search_->elementComparisonType &&
188 m_search_->matchedIndex == that.m_search_->matchedIndex &&
189 m_search_->matchedLength == that.m_search_->matchedLength &&
190 m_search_->textLength == that.m_search_->textLength &&
192 (uprv_memcmp(m_search_->text, that.m_search_->text,
193 m_search_->textLength * sizeof(UChar)) == 0));
222 setOffset(m_search_->textLength, status);
223 return handlePrev(m_search_->textLength, status);
240 int32_t matchindex = m_search_->matchedIndex;
241 int32_t matchlength = m_search_->matchedLength;
242 m_search_->reset = FALSE;
243 if (m_search_->isForwardSearching == TRUE) {
244 int32_t textlength = m_search_->textLength;
259 m_search_->isForwardSearching = TRUE;
260 if (m_search_->matchedIndex != USEARCH_DONE) {
269 if (m_search_->isOverlap) {
285 if (m_search_->reset) {
286 offset = m_search_->textLength;
287 m_search_->isForwardSearching = FALSE;
288 m_search_->reset = FALSE;
295 int32_t matchindex = m_search_->matchedIndex;
296 if (m_search_->isForwardSearching == TRUE) {
302 m_search_->isForwardSearching = FALSE;
316 if (m_search_->isOverlap) {
317 matchindex += m_search_->matchedLength - 2;
334 m_search_->isOverlap = FALSE;
335 m_search_->isCanonicalMatch = FALSE;
336 m_search_->elementComparisonType = 0;
337 m_search_->isForwardSearching = TRUE;
338 m_search_->reset = TRUE;
345 m_search_ = (USearch *)uprv_malloc(sizeof(USearch));
346 m_search_->breakIter = NULL;
347 m_search_->isOverlap = FALSE;
348 m_search_->isCanonicalMatch = FALSE;
349 m_search_->elementComparisonType = 0;
350 m_search_->isForwardSearching = TRUE;
351 m_search_->reset = TRUE;
352 m_search_->matchedIndex = USEARCH_DONE;
353 m_search_->matchedLength = 0;
354 m_search_->text = NULL;
355 m_search_->textLength = 0;
364 m_search_ = (USearch *)uprv_malloc(sizeof(USearch));
365 m_search_->breakIter = NULL;
366 m_search_->isOverlap = FALSE;
367 m_search_->isCanonicalMatch = FALSE;
368 m_search_->elementComparisonType = 0;
369 m_search_->isForwardSearching = TRUE;
370 m_search_->reset = TRUE;
371 m_search_->matchedIndex = USEARCH_DONE;
372 m_search_->matchedLength = 0;
373 m_search_->text = m_text_.getBuffer();
374 m_search_->textLength = text.length();
381 m_search_ = (USearch *)uprv_malloc(sizeof(USearch));
382 m_search_->breakIter = NULL;
383 m_search_->isOverlap = FALSE;
384 m_search_->isCanonicalMatch = FALSE;
385 m_search_->elementComparisonType = 0;
386 m_search_->isForwardSearching = TRUE;
387 m_search_->reset = TRUE;
388 m_search_->matchedIndex = USEARCH_DONE;
389 m_search_->matchedLength = 0;
391 m_search_->text = m_text_.getBuffer();
392 m_search_->textLength = m_text_.length();
403 m_search_->breakIter = that.m_search_->breakIter;
404 m_search_->isCanonicalMatch = that.m_search_->isCanonicalMatch;
405 m_search_->isOverlap = that.m_search_->isOverlap;
406 m_search_->elementComparisonType = that.m_search_->elementComparisonType;
407 m_search_->matchedIndex = that.m_search_->matchedIndex;
408 m_search_->matchedLength = that.m_search_->matchedLength;
409 m_search_->text = that.m_search_->text;
410 m_search_->textLength = that.m_search_->textLength;
417 m_search_->matchedLength = length;
422 m_search_->matchedIndex = position;
432 if (m_search_->isForwardSearching) {
433 setOffset(m_search_->textLength, status);