Lines Matching defs:Length
54 size_t Length;
64 static int compareMemory(const char *Lhs, const char *Rhs, size_t Length) {
65 if (Length == 0) { return 0; }
66 return ::memcmp(Lhs,Rhs,Length);
74 /*implicit*/ StringRef() : Data(0), Length(0) {}
80 Length = ::strlen(Str); // invoking strlen(NULL) is undefined behavior
85 : Data(data), Length(length) {
92 : Data(Str.data()), Length(Str.length()) {}
100 iterator end() const { return Data + Length; }
111 bool empty() const { return Length == 0; }
114 size_t size() const { return Length; }
125 return Data[Length-1];
131 return (Length == RHS.Length &&
132 compareMemory(Data, RHS.Data, RHS.Length) == 0);
137 return Length == RHS.Length && compare_lower(RHS) == 0;
144 if (int Res = compareMemory(Data, RHS.Data, min(Length, RHS.Length)))
148 if (Length == RHS.Length)
150 return Length < RHS.Length ? -1 : 1;
184 return std::string(Data, Length);
192 assert(Index < Length && "Invalid index!");
210 return Length >= Prefix.Length &&
211 compareMemory(Data, Prefix.Data, Prefix.Length) == 0;
216 return Length >= Suffix.Length &&
217 compareMemory(end() - Suffix.Length, Suffix.Data, Suffix.Length) == 0;
229 for (size_t i = min(From, Length), e = Length; i != e; ++i)
246 From = min(From, Length);
313 for (size_t i = 0, e = Length; i != e; ++i)
388 Start = min(Start, Length);
389 return StringRef(Data + Start, min(N, Length - Start));
417 Start = min(Start, Length);
418 End = min(max(Start, End), Length);
494 return drop_front(std::min(Length, find_first_not_of(Chars)));
500 return drop_back(Length - std::min(Length, find_last_not_of(Chars) + 1));