Lines Matching refs:Length

52     size_t Length;
62 static int compareMemory(const char *Lhs, const char *Rhs, size_t Length) {
63 if (Length == 0) { return 0; }
64 return ::memcmp(Lhs,Rhs,Length);
72 /*implicit*/ StringRef() : Data(nullptr), Length(0) {}
78 Length = ::strlen(Str); // invoking strlen(NULL) is undefined behavior
83 : Data(data), Length(length) {
90 : Data(Str.data()), Length(Str.length()) {}
98 iterator end() const { return Data + Length; }
109 bool empty() const { return Length == 0; }
112 size_t size() const { return Length; }
123 return Data[Length-1];
128 char *S = A.template Allocate<char>(Length);
130 return StringRef(S, Length);
136 return (Length == RHS.Length &&
137 compareMemory(Data, RHS.Data, RHS.Length) == 0);
142 return Length == RHS.Length && compare_lower(RHS) == 0;
149 if (int Res = compareMemory(Data, RHS.Data, min(Length, RHS.Length)))
153 if (Length == RHS.Length)
155 return Length < RHS.Length ? -1 : 1;
189 return std::string(Data, Length);
197 assert(Index < Length && "Invalid index!");
215 return Length >= Prefix.Length &&
216 compareMemory(Data, Prefix.Data, Prefix.Length) == 0;
224 return Length >= Suffix.Length &&
225 compareMemory(end() - Suffix.Length, Suffix.Data, Suffix.Length) == 0;
240 for (size_t i = min(From, Length), e = Length; i != e; ++i)
257 From = min(From, Length);
324 for (size_t i = 0, e = Length; i != e; ++i)
399 Start = min(Start, Length);
400 return StringRef(Data + Start, min(N, Length - Start));
428 Start = min(Start, Length);
429 End = min(max(Start, End), Length);
505 return drop_front(std::min(Length, find_first_not_of(Chars)));
511 return drop_back(Length - std::min(Length, find_last_not_of(Chars) + 1));