/external/icu4c/test/cintltst/ |
H A D | custrtst.c | 376 log_err("Didn't get NULL for empty string\n"); 379 log_err("State should be NULL for empty string\n"); 399 log_err("State should be NULL for empty string\n"); 493 empty[] = { 0 }, local 528 if (u_strpbrk(testString, empty) != NULL) { 565 log_err("u_strpbrk should have returned NULL for empty string.\n"); 628 log_err("u_strcspn should have returned strlen for empty string.\n"); 652 if (u_strspn(testString, empty) != 0) { 653 log_err("u_strspn should have returned 0 for empty string.\n"); 682 log_err("u_strspn should have returned 0 for empty strin [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | DenseMap.h | 54 // When the map is empty, avoid the overhead of AdvancePastEmptyBuckets(). 55 return empty() ? end() : iterator(getBuckets(), getBucketsEnd()); 61 return empty() ? end() : const_iterator(getBuckets(), getBucketsEnd()); 67 bool empty() const { return getNumEntries() == 0; } function in class:llvm::DenseMapBase 407 // the buckets are empty (meaning that many are filled with tombstones), 410 // The later case is tricky. For example, if we had one empty bucket with 412 // probe almost the entire table until it found the empty bucket. If the 440 /// true, otherwise it returns a bucket with an empty marker or tombstone and 471 // If we found an empty bucket, the key doesn't exist in the set. 475 // of the empty bucke [all...] |
H A D | ilist.h | 21 // provide a constant time size() method, so be careful to use empty() when you 22 // really want to know if it's empty. 300 /// 2. The list may be empty, but contain a sentinel for the end iterator. This 302 /// in the list. When the list is empty, the pointer in the iplist points 384 bool empty() const { return Head == 0 || Head == getTail(); } function in class:llvm::iplist 388 assert(!empty() && "Called front() on empty list!"); 392 assert(!empty() && "Called front() on empty list!"); 396 assert(!empty() [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | MachineBasicBlock.h | 76 /// has the same order as Successors, or it is empty if we don't use it 217 bool empty() const { return Insts.empty(); } function in class:llvm::MachineBasicBlock 272 bool pred_empty() const { return Predecessors.empty(); } 288 bool succ_empty() const { return Successors.empty(); } 309 bool livein_empty() const { return LiveIns.empty(); }
|
H A D | SelectionDAG.h | 95 bool empty() const { function in class:llvm::SDDbgInfo 96 return DbgValues.empty() && ByvalParmDbgValues.empty(); 955 bool hasDebugValues() const { return !DbgInfo->empty(); }
|
/external/mksh/src/ |
H A D | var.c | 63 static const char *empty[] = { null }; local 71 l->argv = empty;
|
/external/openssl/ssl/ |
H A D | t1_enc.c | 321 static const unsigned char empty[]=""; local 525 empty,0,iv1,iv2,k*2))
|
/external/qemu/android/skin/ |
H A D | trackball.c | 309 int empty = 0, total = 0; local 365 empty++;
|
/external/qemu/elff/ |
H A D | dwarf_defs.h | 822 * NOTE: This method cannot be called on an empty array. Usually, first
869 void empty() {
function in class:DwarfAbbrDieArray
|
/external/regex-re2/re2/ |
H A D | compile.cc | 166 // Returns a fragment that matches the empty string. 175 // Returns a fragment matching an empty-width special op. 427 // Returns a fragment matching a particular empty-width op (like ^ or $) 428 Frag Compiler::EmptyWidth(EmptyOp empty) { argument 432 inst_[id].InitEmptyWidth(empty, 0); 433 if (empty & (kEmptyBeginLine|kEmptyEndLine)) 435 if (empty & (kEmptyWordBoundary|kEmptyNonWordBoundary)) { 790 if (cc->empty()) {
|
H A D | regexp.h | 99 // Matches empty string. 134 // Matches empty string at beginning of line. 136 // Matches empty string at end of line. 144 // Matches empty string at beginning of text. 146 // Matches empty string at end of text. 246 bool empty() { return nrunes_ == 0; } function in class:re2::CharClass 426 // begin with a non-empty fixed string (perhaps after ASCII 585 bool empty() { return nrunes_ == 0; } function in class:re2::CharClassBuilder
|
/external/skia/tests/ |
H A D | PathTest.cpp | 202 SkPath empty; local 203 check_close(reporter, empty); 204 empty.close(); 205 check_close(reporter, empty); 780 // Test that setting an empty path works 783 // Test that close path makes no difference for an empty path 787 // Test an iterator with an initial empty path 848 // Test that setting an empty path works 852 // Test an iterator with an initial empty path
|
/external/stlport/stlport/stl/ |
H A D | _bvector.h | 491 bool empty() const { return begin() == end(); } function in class:__BVECTOR_QUALIFIED
|
H A D | _deque.h | 63 * that an empty deque must have one node, and that a deque 72 * [map, map + map_size) is a valid, non-empty range. 473 bool empty() const { return this->_M_finish == this->_M_start; } function in class:deque
|
H A D | _list.h | 194 if (src.get().empty()) 195 //We force this to empty. 208 bool empty() const { return _M_node._M_data._M_next == &_M_node._M_data; } function in class:_List_base 402 if (__x.empty()) { 403 if (this->empty()) { 407 } else if (this->empty()) { 600 if (!__x.empty()) {
|
H A D | _slist.h | 408 // insert_after, erase_after, etc. Note that even for an empty 428 bool empty() const { return this->_M_head._M_data._M_next == 0; } function in class:slist
|
H A D | _string.h | 292 /* We need an additionnal constructor to build an empty string without 422 if (!empty()) { 428 bool empty() const { return this->_M_Start() == this->_M_Finish(); } function in class:basic_string
|
H A D | _tree.h | 432 bool empty() const { return _M_node_count == 0; } function in class:_Rb_tree 437 if (__t.empty()) { 438 if (this->empty()) return; 443 else if (this->empty()) {
|
H A D | _vector.h | 81 //Set the source as empty: 200 bool empty() const { return this->_M_start == this->_M_finish; } function in class:vector
|
/external/v8/src/ |
H A D | handles.cc | 401 Handle<FixedArray> empty = isolate->factory()->NewFixedArray(0); local 402 script->set_line_ends(*empty);
|
H A D | stub-cache.cc | 107 // and we use the empty string for the map cache in that case. If 878 Code* empty = isolate_->builtins()->builtin(Builtins::kIllegal); local 881 primary_[i].value = empty; 885 secondary_[j].value = empty;
|
/external/v8/test/cctest/ |
H A D | test-heap.cc | 572 // check for empty 847 Handle<JSObject> empty; local 848 runaway = empty.EscapeFrom(&nested); 1296 // Let the scavenger empty the new space.
|
/external/webkit/Source/JavaScriptCore/jit/ |
H A D | JITPropertyAccess.cpp | 133 linkSlowCase(iter); // empty value 204 Jump empty = branchTestPtr(Zero, BaseIndex(regT2, regT1, ScalePtr, OBJECT_OFFSETOF(ArrayStorage, m_vector[0]))); local 211 empty.link(this); 616 ASSERT(!failureCases.empty());
|
H A D | JITPropertyAccess32_64.cpp | 346 linkSlowCase(iter); // empty value 369 Jump empty = branch32(Equal, BaseIndex(regT3, regT2, TimesEight, OBJECT_OFFSETOF(ArrayStorage, m_vector[0]) + OBJECT_OFFSETOF(JSValue, u.asBits.tag)), TrustedImm32(JSValue::EmptyValueTag)); local 377 empty.link(this); 639 ASSERT(!failureCases.empty());
|
/external/webkit/Source/WebCore/loader/appcache/ |
H A D | ApplicationCacheStorage.cpp | 649 // When a cache resource is deleted, if it contains a non-empty path, that path should 1197 void ApplicationCacheStorage::empty() function in class:WebCore::ApplicationCacheStorage 1221 empty(); 1292 copyStorage.empty(); 1491 empty();
|