1 //===-- StringList.cpp ------------------------------------------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 #include "lldb/Utility/StringList.h"
12 #include "lldb/Utility/Log.h"
13 #include "lldb/Utility/Stream.h" // for Stream
14 #include "lldb/Utility/StreamString.h"
15 #include "llvm/ADT/ArrayRef.h" // for ArrayRef, makeArrayRef
17 #include <algorithm> // for min
18 #include <stdint.h> // for SIZE_MAX, uint32_t
19 #include <string.h> // for size_t, strcspn, NULL
21 using namespace lldb_private;
23 StringList::StringList() : m_strings() {}
25 StringList::StringList(const char *str) : m_strings() {
27 m_strings.push_back(str);
30 StringList::StringList(const char **strv, int strc) : m_strings() {
31 for (int i = 0; i < strc; ++i) {
33 m_strings.push_back(strv[i]);
37 StringList::~StringList() {}
39 void StringList::AppendString(const char *str) {
41 m_strings.push_back(str);
44 void StringList::AppendString(const std::string &s) { m_strings.push_back(s); }
46 void StringList::AppendString(std::string &&s) { m_strings.push_back(s); }
48 void StringList::AppendString(const char *str, size_t str_len) {
50 m_strings.push_back(std::string(str, str_len));
53 void StringList::AppendString(llvm::StringRef str) {
54 m_strings.push_back(str.str());
57 void StringList::AppendList(const char **strv, int strc) {
58 for (int i = 0; i < strc; ++i) {
60 m_strings.push_back(strv[i]);
64 void StringList::AppendList(StringList strings) {
65 size_t len = strings.GetSize();
67 for (size_t i = 0; i < len; ++i)
68 m_strings.push_back(strings.GetStringAtIndex(i));
71 size_t StringList::GetSize() const { return m_strings.size(); }
73 size_t StringList::GetMaxStringLength() const {
74 size_t max_length = 0;
75 for (const auto &s : m_strings) {
76 const size_t len = s.size();
83 const char *StringList::GetStringAtIndex(size_t idx) const {
84 if (idx < m_strings.size())
85 return m_strings[idx].c_str();
89 void StringList::Join(const char *separator, Stream &strm) {
90 size_t size = GetSize();
95 for (uint32_t i = 0; i < size; ++i) {
97 strm.PutCString(separator);
98 strm.PutCString(GetStringAtIndex(i));
102 void StringList::Clear() { m_strings.clear(); }
104 void StringList::LongestCommonPrefix(std::string &common_prefix) {
105 common_prefix.clear();
106 if (m_strings.empty())
109 auto args = llvm::makeArrayRef(m_strings);
110 llvm::StringRef prefix = args.front();
111 for (auto arg : args.drop_front()) {
113 for (count = 0; count < std::min(prefix.size(), arg.size()); ++count) {
114 if (prefix[count] != arg[count])
117 prefix = prefix.take_front(count);
119 common_prefix = prefix;
122 void StringList::InsertStringAtIndex(size_t idx, const char *str) {
124 if (idx < m_strings.size())
125 m_strings.insert(m_strings.begin() + idx, str);
127 m_strings.push_back(str);
131 void StringList::InsertStringAtIndex(size_t idx, const std::string &str) {
132 if (idx < m_strings.size())
133 m_strings.insert(m_strings.begin() + idx, str);
135 m_strings.push_back(str);
138 void StringList::InsertStringAtIndex(size_t idx, std::string &&str) {
139 if (idx < m_strings.size())
140 m_strings.insert(m_strings.begin() + idx, str);
142 m_strings.push_back(str);
145 void StringList::DeleteStringAtIndex(size_t idx) {
146 if (idx < m_strings.size())
147 m_strings.erase(m_strings.begin() + idx);
150 size_t StringList::SplitIntoLines(const std::string &lines) {
151 return SplitIntoLines(lines.c_str(), lines.size());
154 size_t StringList::SplitIntoLines(const char *lines, size_t len) {
155 const size_t orig_size = m_strings.size();
160 const char *k_newline_chars = "\r\n";
161 const char *p = lines;
162 const char *end = lines + len;
164 size_t count = strcspn(p, k_newline_chars);
166 if (p[count] == '\r' || p[count] == '\n')
167 m_strings.push_back(std::string());
173 m_strings.push_back(std::string(p, count));
175 if (p[count] == '\r' && p[count + 1] == '\n')
176 count++; // Skip an extra newline char for the DOS newline
177 count++; // Skip the newline character
180 return m_strings.size() - orig_size;
183 void StringList::RemoveBlankLines() {
188 while (idx < m_strings.size()) {
189 if (m_strings[idx].empty())
190 DeleteStringAtIndex(idx);
196 std::string StringList::CopyList(const char *item_preamble,
197 const char *items_sep) const {
199 for (size_t i = 0; i < GetSize(); i++) {
200 if (i && items_sep && items_sep[0])
203 strm << item_preamble;
204 strm << GetStringAtIndex(i);
206 return strm.GetString();
209 StringList &StringList::operator<<(const char *str) {
214 StringList &StringList::operator<<(const std::string &str) {
219 StringList &StringList::operator<<(StringList strings) {
224 StringList &StringList::operator=(const std::vector<std::string> &rhs) {
225 m_strings.assign(rhs.begin(), rhs.end());
230 size_t StringList::AutoComplete(llvm::StringRef s, StringList &matches,
231 size_t &exact_idx) const {
233 exact_idx = SIZE_MAX;
235 // No string, so it matches everything
237 return matches.GetSize();
240 const size_t s_len = s.size();
241 const size_t num_strings = m_strings.size();
243 for (size_t i = 0; i < num_strings; ++i) {
244 if (m_strings[i].find(s) == 0) {
245 if (exact_idx == SIZE_MAX && m_strings[i].size() == s_len)
246 exact_idx = matches.GetSize();
247 matches.AppendString(m_strings[i]);
250 return matches.GetSize();
253 void StringList::LogDump(Log *log, const char *name) {
259 strm.Printf("Begin %s:\n", name);
260 for (const auto &s : m_strings) {
262 strm.Printf("%s\n", s.c_str());
265 strm.Printf("End %s.\n", name);
267 LLDB_LOGV(log, "{0}", strm.GetData());