/external/regex-re2/util/ |
H A D | stringpiece.cc | 33 target->assign(ptr_, length_); 37 int ret = min(length_ - pos, n); 43 if (length_ < 0 || pos > static_cast<size_type>(length_)) 46 const char* result = std::search(ptr_ + pos, ptr_ + length_, 47 s.ptr_, s.ptr_ + s.length_); 49 return xpos + s.length_ <= length_ ? xpos : npos; 53 if (length_ <= 0 || pos >= static_cast<size_type>(length_)) { [all...] |
/external/regex-re2/re2/ |
H A D | stringpiece.h | 32 int length_; member in class:re2::StringPiece 38 StringPiece() : ptr_(NULL), length_(0) { } 40 : ptr_(str), length_((str == NULL) ? 0 : static_cast<int>(strlen(str))) { } 42 : ptr_(str.data()), length_(static_cast<int>(str.size())) { } 43 StringPiece(const char* offset, int len) : ptr_(offset), length_(len) { } 50 int size() const { return length_; } 51 int length() const { return length_; } 52 bool empty() const { return length_ == 0; } 54 void clear() { ptr_ = NULL; length_ = 0; } 55 void set(const char* data, int len) { ptr_ = data; length_ [all...] |
/external/icu4c/common/ |
H A D | stringpiece.cpp | 17 : ptr_(str), length_((str == NULL) ? 0 : static_cast<int32_t>(uprv_strlen(str))) { } 22 } else if (pos > x.length_) { 23 pos = x.length_; 26 length_ = x.length_ - pos; 32 } else if (pos > x.length_) { 33 pos = x.length_; 37 } else if (len > x.length_ - pos) { 38 len = x.length_ - pos; 41 length_ [all...] |
/external/icu4c/common/unicode/ |
H A D | stringpiece.h | 55 int32_t length_; member in class:StringPiece 62 StringPiece() : ptr_(NULL), length_(0) { } 75 : ptr_(str.data()), length_(static_cast<int32_t>(str.size())) { } 83 StringPiece(const char* offset, int32_t len) : ptr_(offset), length_(len) { } 117 int32_t size() const { return length_; } 123 int32_t length() const { return length_; } 129 UBool empty() const { return length_ == 0; } 135 void clear() { ptr_ = NULL; length_ = 0; } 143 void set(const char* xdata, int32_t len) { ptr_ = xdata; length_ = len; } 159 if (n > length_) { [all...] |
/external/chromium/base/ |
H A D | string_piece.cc | 32 size_type ret = std::min(length_ - pos, n); 38 if (pos > length_) 41 const char* result = std::search(ptr_ + pos, ptr_ + length_, 42 s.ptr_, s.ptr_ + s.length_); 44 return xpos + s.length_ <= length_ ? xpos : npos; 48 if (pos >= length_) 51 const char* result = std::find(ptr_ + pos, ptr_ + length_, c); 52 return result != ptr_ + length_ ? static_cast<size_t>(result - ptr_) : npos; 56 if (length_ < [all...] |
H A D | string_piece.h | 49 StringPiece() : ptr_(NULL), length_(0) { } 51 : ptr_(str), length_((str == NULL) ? 0 : strlen(str)) { } 53 : ptr_(str.data()), length_(str.size()) { } 55 : ptr_(offset), length_(len) { } 62 size_type size() const { return length_; } 63 size_type length() const { return length_; } 64 bool empty() const { return length_ == 0; } 68 length_ = 0; 72 length_ = len; 76 length_ 164 size_type length_; member in class:base::StringPiece [all...] |
/external/marisa-trie/lib/marisa/ |
H A D | marisa-string.h | 10 String() : ptr_(NULL), length_(0) {} 11 explicit String(const char *str) : ptr_(str), length_(0) { 12 while (str[length_] != '\0') { 13 ++length_; 17 : ptr_(ptr), length_(length) {} 18 String(const String &str) : ptr_(str.ptr_), length_(str.length_) {} 21 MARISA_DEBUG_IF(pos + length > length_, MARISA_PARAM_ERROR); 27 length_ = str.length_; 45 std::size_t length_; member in class:marisa::String 117 std::size_t length_; member in class:marisa::RString [all...] |
H A D | cell.h | 10 Cell() : louds_pos_(0), node_(0), key_id_(0), length_(0) {} 22 length_ = length; 35 return length_; 42 std::size_t length_; member in class:marisa::Cell
|
H A D | query.h | 12 Query(const char *ptr, std::size_t length) : ptr_(ptr), length_(length) {} 13 Query(const Query &query) : ptr_(query.ptr_), length_(query.length_) {} 16 str->insert(0, ptr_, length_); 20 MARISA_DEBUG_IF(i >= length_, MARISA_PARAM_ERROR); 24 MARISA_DEBUG_IF(i > length_, MARISA_PARAM_ERROR); 25 return i == length_; 30 std::size_t length_; member in class:marisa::Query
|
/external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
H A D | marisa-string.h | 10 String() : ptr_(NULL), length_(0) {} 11 explicit String(const char *str) : ptr_(str), length_(0) { 12 while (str[length_] != '\0') { 13 ++length_; 17 : ptr_(ptr), length_(length) {} 18 String(const String &str) : ptr_(str.ptr_), length_(str.length_) {} 21 MARISA_ALPHA_DEBUG_IF(pos + length > length_, MARISA_ALPHA_PARAM_ERROR); 27 length_ = str.length_; 45 std::size_t length_; member in class:marisa_alpha::String 117 std::size_t length_; member in class:marisa_alpha::RString [all...] |
H A D | cell.h | 10 Cell() : louds_pos_(0), node_(0), key_id_(0), length_(0) {} 22 length_ = length; 35 return length_; 42 std::size_t length_; member in class:marisa_alpha::Cell
|
H A D | query.h | 12 Query(const char *ptr, std::size_t length) : ptr_(ptr), length_(length) {} 13 Query(const Query &query) : ptr_(query.ptr_), length_(query.length_) {} 16 str->insert(0, ptr_, length_); 20 MARISA_ALPHA_DEBUG_IF(i >= length_, MARISA_ALPHA_PARAM_ERROR); 24 MARISA_ALPHA_DEBUG_IF(i > length_, MARISA_ALPHA_PARAM_ERROR); 25 return i == length_; 30 std::size_t length_; member in class:marisa_alpha::Query
|
/external/chromium-trace/trace-viewer/src/ |
H A D | selection.js | 53 this.length_ = 0; 61 for (var i = 0; i < this.length_; i++) { 80 return this.length_; 84 for (var i = 0; i < this.length_; ++i) 86 this.length_ = 0; 95 this[this.length_++] = hit; 115 if (index < 0 || index + count > this.length_) 126 for (var i = 0; i < this.length_; i++) 134 for (var i = 0; i < this.length_; i++) 142 for (var i = 0; i < this.length_; [all...] |
/external/chromium/third_party/libjingle/source/talk/base/ |
H A D | buffer.h | 57 size_t length() const { return length_; } 67 return (length_ == buf.length() && 68 memcmp(data_.get(), buf.data(), length_) == 0); 81 size_t old_length = length_; 82 SetLength(length_ + length); 87 length_ = length; 92 memcpy(data.get(), data_.get(), length_); 101 buf->length_ = length_; 113 size_t length_; member in class:talk_base::Buffer [all...] |
H A D | cryptstring.h | 96 length_ = 0; 105 EnsureStorage(length_ + length + 1); 106 memcpy(storage_ + length_, data, length); 107 length_ += length; 108 storage_[length_] = '\0'; 113 EnsureStorage(length_ + len + 1); 114 password->CopyTo(storage_ + length_, true); 115 length_ += len; 119 return length_; 145 memcpy(storage_, old_storage, length_); 168 size_t length_; member in class:talk_base::FormatCryptString [all...] |
/external/v8/src/ |
H A D | list-inl.h | 39 if (length_ < capacity_) { 40 data_[length_++] = element; 55 int result_length = length_ + other.length(); 58 data_[length_ + i] = other.at(i); 60 length_ = result_length; 74 ASSERT(length_ >= capacity_); 82 data_[length_++] = temp; 98 int start = length_; 106 ASSERT(index >= 0 && index <= length_); 108 for (int i = length_ [all...] |
H A D | list.h | 73 ASSERT(i < length_); 77 inline T& last() const { return at(length_ - 1); } 80 INLINE(bool is_empty() const) { return length_ == 0; } 81 INLINE(int length() const) { return length_; } 84 Vector<T> ToVector() const { return Vector<T>(data_, length_); } 86 Vector<const T> ToConstVector() { return Vector<const T>(data_, length_); } 118 INLINE(T RemoveLast()) { return Remove(length_ - 1); } 128 INLINE(void RewindBy(int count)) { Rewind(length_ - count); } 147 int length_;
|
H A D | arguments.h | 39 // (length_, arguments_) are "overlayed" with the parameters 51 : length_(length), arguments_(arguments) { } 54 ASSERT(0 <= index && index < length_); 75 int length() const { return length_; } 80 int length_; member in class:v8::internal::BASE_EMBEDDED
|
/external/chromium/net/spdy/ |
H A D | spdy_frame_builder.h | 41 int length() const { return length_; } 48 length_ = 0; 85 if (offset + data_len > length_) 123 const char* end_of_payload() const { return buffer_ + length_; } 153 size_t length_; // current length of the buffer member in class:spdy::SpdyFrameBuilder
|
/external/chromium/base/memory/ |
H A D | ref_counted_memory.h | 41 : data_(NULL), length_(0) {} 43 : data_(data), length_(length) {} 51 size_t length_; member in class:RefCountedStaticMemory
|
/external/chromium/chrome/browser/resources/shared/js/cr/ui/ |
H A D | list_selection_model.js | 18 this.length_ = opt_length || 0; 32 return this.length_; 112 this.length_ = 0; 211 var li = Math.max(-1, Math.min(this.length_ - 1, leadIndex)); 229 var ai = Math.max(-1, Math.min(this.length_ - 1, anchorIndex)); 270 this.length_ += itemsAdded - itemsRemoved;
|
H A D | list_single_selection_model.js | 19 this.length_ = opt_length || 0; 31 return this.length_; 51 var i = Math.max(-1, Math.min(this.length_ - 1, selectedIndex)); 83 this.length_ = 0; 167 var li = Math.max(-1, Math.min(this.length_ - 1, leadIndex)); 220 this.length_ += itemsAdded - itemsRemoved;
|
/external/chromium/testing/gtest/include/gtest/internal/ |
H A D | gtest-string.h | 192 String() : c_str_(NULL), length_(0) {} 198 length_ = 0; 214 String(const String& str) : c_str_(NULL), length_(0) { *this = str; } 270 size_t length() const { return length_; } 288 length_ = 0; 307 length_ = a_length; 311 size_t length_; member in class:testing::internal::String
|
/external/gtest/include/gtest/internal/ |
H A D | gtest-string.h | 192 String() : c_str_(NULL), length_(0) {} 198 length_ = 0; 214 String(const String& str) : c_str_(NULL), length_(0) { *this = str; } 270 size_t length() const { return length_; } 288 length_ = 0; 307 length_ = a_length; 311 size_t length_; member in class:testing::internal::String
|
/external/libvpx/libvpx/third_party/googletest/src/include/gtest/internal/ |
H A D | gtest-string.h | 192 String() : c_str_(NULL), length_(0) {} 198 length_ = 0; 214 String(const String& str) : c_str_(NULL), length_(0) { *this = str; } 270 size_t length() const { return length_; } 288 length_ = 0; 307 length_ = a_length; 311 size_t length_; member in class:testing::internal::String
|