1 //===-- StringList.cpp ------------------------------------------*- C++ -*-===//
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
9 #include "lldb/Utility/StringList.h"
11 #include "lldb/Utility/Log.h"
12 #include "lldb/Utility/Stream.h"
13 #include "lldb/Utility/StreamString.h"
14 #include "llvm/ADT/ArrayRef.h"
20 using namespace lldb_private;
22 StringList::StringList() : m_strings() {}
24 StringList::StringList(const char *str) : m_strings() {
26 m_strings.push_back(str);
29 StringList::StringList(const char **strv, int strc) : m_strings() {
30 for (int i = 0; i < strc; ++i) {
32 m_strings.push_back(strv[i]);
36 StringList::~StringList() {}
38 void StringList::AppendString(const char *str) {
40 m_strings.push_back(str);
43 void StringList::AppendString(const std::string &s) { m_strings.push_back(s); }
45 void StringList::AppendString(std::string &&s) { m_strings.push_back(s); }
47 void StringList::AppendString(const char *str, size_t str_len) {
49 m_strings.push_back(std::string(str, str_len));
52 void StringList::AppendString(llvm::StringRef str) {
53 m_strings.push_back(str.str());
56 void StringList::AppendList(const char **strv, int strc) {
57 for (int i = 0; i < strc; ++i) {
59 m_strings.push_back(strv[i]);
63 void StringList::AppendList(StringList strings) {
64 size_t len = strings.GetSize();
66 for (size_t i = 0; i < len; ++i)
67 m_strings.push_back(strings.GetStringAtIndex(i));
70 size_t StringList::GetSize() const { return m_strings.size(); }
72 size_t StringList::GetMaxStringLength() const {
73 size_t max_length = 0;
74 for (const auto &s : m_strings) {
75 const size_t len = s.size();
82 const char *StringList::GetStringAtIndex(size_t idx) const {
83 if (idx < m_strings.size())
84 return m_strings[idx].c_str();
88 void StringList::Join(const char *separator, Stream &strm) {
89 size_t size = GetSize();
94 for (uint32_t i = 0; i < size; ++i) {
96 strm.PutCString(separator);
97 strm.PutCString(GetStringAtIndex(i));
101 void StringList::Clear() { m_strings.clear(); }
103 void StringList::LongestCommonPrefix(std::string &common_prefix) {
104 common_prefix.clear();
105 if (m_strings.empty())
108 auto args = llvm::makeArrayRef(m_strings);
109 llvm::StringRef prefix = args.front();
110 for (auto arg : args.drop_front()) {
112 for (count = 0; count < std::min(prefix.size(), arg.size()); ++count) {
113 if (prefix[count] != arg[count])
116 prefix = prefix.take_front(count);
118 common_prefix = prefix;
121 void StringList::InsertStringAtIndex(size_t idx, const char *str) {
123 if (idx < m_strings.size())
124 m_strings.insert(m_strings.begin() + idx, str);
126 m_strings.push_back(str);
130 void StringList::InsertStringAtIndex(size_t idx, const std::string &str) {
131 if (idx < m_strings.size())
132 m_strings.insert(m_strings.begin() + idx, str);
134 m_strings.push_back(str);
137 void StringList::InsertStringAtIndex(size_t idx, std::string &&str) {
138 if (idx < m_strings.size())
139 m_strings.insert(m_strings.begin() + idx, str);
141 m_strings.push_back(str);
144 void StringList::DeleteStringAtIndex(size_t idx) {
145 if (idx < m_strings.size())
146 m_strings.erase(m_strings.begin() + idx);
149 size_t StringList::SplitIntoLines(const std::string &lines) {
150 return SplitIntoLines(lines.c_str(), lines.size());
153 size_t StringList::SplitIntoLines(const char *lines, size_t len) {
154 const size_t orig_size = m_strings.size();
159 const char *k_newline_chars = "\r\n";
160 const char *p = lines;
161 const char *end = lines + len;
163 size_t count = strcspn(p, k_newline_chars);
165 if (p[count] == '\r' || p[count] == '\n')
166 m_strings.push_back(std::string());
172 m_strings.push_back(std::string(p, count));
174 if (p[count] == '\r' && p[count + 1] == '\n')
175 count++; // Skip an extra newline char for the DOS newline
176 count++; // Skip the newline character
179 return m_strings.size() - orig_size;
182 void StringList::RemoveBlankLines() {
187 while (idx < m_strings.size()) {
188 if (m_strings[idx].empty())
189 DeleteStringAtIndex(idx);
195 std::string StringList::CopyList(const char *item_preamble,
196 const char *items_sep) const {
198 for (size_t i = 0; i < GetSize(); i++) {
199 if (i && items_sep && items_sep[0])
202 strm << item_preamble;
203 strm << GetStringAtIndex(i);
205 return strm.GetString();
208 StringList &StringList::operator<<(const char *str) {
213 StringList &StringList::operator<<(const std::string &str) {
218 StringList &StringList::operator<<(StringList strings) {
223 StringList &StringList::operator=(const std::vector<std::string> &rhs) {
224 m_strings.assign(rhs.begin(), rhs.end());
229 size_t StringList::AutoComplete(llvm::StringRef s, StringList &matches,
230 size_t &exact_idx) const {
232 exact_idx = SIZE_MAX;
234 // No string, so it matches everything
236 return matches.GetSize();
239 const size_t s_len = s.size();
240 const size_t num_strings = m_strings.size();
242 for (size_t i = 0; i < num_strings; ++i) {
243 if (m_strings[i].find(s) == 0) {
244 if (exact_idx == SIZE_MAX && m_strings[i].size() == s_len)
245 exact_idx = matches.GetSize();
246 matches.AppendString(m_strings[i]);
249 return matches.GetSize();
252 void StringList::LogDump(Log *log, const char *name) {
258 strm.Printf("Begin %s:\n", name);
259 for (const auto &s : m_strings) {
261 strm.Printf("%s\n", s.c_str());
264 strm.Printf("End %s.\n", name);
266 LLDB_LOGV(log, "{0}", strm.GetData());