mirror of
https://github.com/RGBCube/serenity
synced 2025-07-25 02:07:34 +00:00
AK: Make Vector use size_t for its size and capacity
This commit is contained in:
parent
9c6f7d3e7d
commit
ceec1a7d38
94 changed files with 323 additions and 317 deletions
|
@ -146,7 +146,7 @@ public:
|
|||
return {};
|
||||
}
|
||||
|
||||
for (int row = 0; row < node.parent->parent->children.size(); ++row) {
|
||||
for (size_t row = 0; row < node.parent->parent->children.size(); ++row) {
|
||||
if (node.parent->parent->children[row].ptr() == node.parent)
|
||||
return create_index(row, 0, node.parent);
|
||||
}
|
||||
|
@ -260,7 +260,7 @@ void Project::rebuild_tree()
|
|||
ProjectTreeNode* current = root.ptr();
|
||||
StringBuilder partial_path;
|
||||
|
||||
for (int i = 0; i < path.parts().size(); ++i) {
|
||||
for (size_t i = 0; i < path.parts().size(); ++i) {
|
||||
auto& part = path.parts().at(i);
|
||||
if (part == ".")
|
||||
continue;
|
||||
|
|
|
@ -143,7 +143,7 @@ void TerminalWrapper::run_command(const String& command)
|
|||
auto parts = command.split(' ');
|
||||
ASSERT(!parts.is_empty());
|
||||
const char** args = (const char**) calloc(parts.size() + 1, sizeof(const char*));
|
||||
for (int i = 0; i < parts.size(); i++) {
|
||||
for (size_t i = 0; i < parts.size(); i++) {
|
||||
args[i] = parts[i].characters();
|
||||
}
|
||||
rc = execvp(args[0], const_cast<char**>(args));
|
||||
|
|
|
@ -358,7 +358,7 @@ int main(int argc, char** argv)
|
|||
wrappers.append(&child);
|
||||
return IterationDecision::Continue;
|
||||
});
|
||||
for (int i = 0; i < wrappers.size(); ++i) {
|
||||
for (size_t i = 0; i < wrappers.size(); ++i) {
|
||||
if (g_current_editor_wrapper.ptr() == wrappers[i]) {
|
||||
if (i == wrappers.size() - 1)
|
||||
wrappers[0]->editor().set_focus(true);
|
||||
|
|
|
@ -263,7 +263,7 @@ int main(int argc, char** argv)
|
|||
}
|
||||
|
||||
builder.append('(');
|
||||
for (int i = 0; i < parameters.size(); ++i) {
|
||||
for (size_t i = 0; i < parameters.size(); ++i) {
|
||||
auto& parameter = parameters[i];
|
||||
builder.append("const ");
|
||||
builder.append(parameter.type);
|
||||
|
@ -273,7 +273,7 @@ int main(int argc, char** argv)
|
|||
builder.append(", ");
|
||||
}
|
||||
builder.append(") : ");
|
||||
for (int i = 0; i < parameters.size(); ++i) {
|
||||
for (size_t i = 0; i < parameters.size(); ++i) {
|
||||
auto& parameter = parameters[i];
|
||||
builder.append("m_");
|
||||
builder.append(parameter.name);
|
||||
|
@ -310,9 +310,9 @@ int main(int argc, char** argv)
|
|||
dbg() << " " << parameter.type << " " << parameter.name << " = " << initial_value << ";";
|
||||
|
||||
if (parameter.type == "Vector<Gfx::Rect>") {
|
||||
dbg() << " int " << parameter.name << "_size = 0;";
|
||||
dbg() << " u64 " << parameter.name << "_size = 0;";
|
||||
dbg() << " stream >> " << parameter.name << "_size;";
|
||||
dbg() << " for (int i = 0; i < " << parameter.name << "_size; ++i) {";
|
||||
dbg() << " for (size_t i = 0; i < " << parameter.name << "_size; ++i) {";
|
||||
dbg() << " Gfx::Rect rect;";
|
||||
dbg() << " if (!decoder.decode(rect))";
|
||||
dbg() << " return nullptr;";
|
||||
|
@ -325,7 +325,7 @@ int main(int argc, char** argv)
|
|||
}
|
||||
|
||||
StringBuilder builder;
|
||||
for (int i = 0; i < parameters.size(); ++i) {
|
||||
for (size_t i = 0; i < parameters.size(); ++i) {
|
||||
auto& parameter = parameters[i];
|
||||
builder.append(parameter.name);
|
||||
if (i != parameters.size() - 1)
|
||||
|
@ -355,7 +355,7 @@ int main(int argc, char** argv)
|
|||
dbg() << " stream << m_" << parameter.name << ".width();";
|
||||
dbg() << " stream << m_" << parameter.name << ".height();";
|
||||
} else if (parameter.type == "Vector<Gfx::Rect>") {
|
||||
dbg() << " stream << m_" << parameter.name << ".size();";
|
||||
dbg() << " stream << (u64)m_" << parameter.name << ".size();";
|
||||
dbg() << " for (auto& rect : m_" << parameter.name << ") {";
|
||||
dbg() << " stream << rect.x();";
|
||||
dbg() << " stream << rect.y();";
|
||||
|
|
|
@ -64,7 +64,7 @@ GUI::ModelIndex RemoteObjectGraphModel::parent_index(const GUI::ModelIndex& inde
|
|||
|
||||
// NOTE: If the parent has no parent, it's a root, so we have to look among the remote roots.
|
||||
if (!remote_object.parent->parent) {
|
||||
for (int row = 0; row < m_process.roots().size(); ++row) {
|
||||
for (size_t row = 0; row < m_process.roots().size(); ++row) {
|
||||
if (&m_process.roots()[row] == remote_object.parent)
|
||||
return create_index(row, 0, remote_object.parent);
|
||||
}
|
||||
|
@ -72,7 +72,7 @@ GUI::ModelIndex RemoteObjectGraphModel::parent_index(const GUI::ModelIndex& inde
|
|||
return {};
|
||||
}
|
||||
|
||||
for (int row = 0; row < remote_object.parent->parent->children.size(); ++row) {
|
||||
for (size_t row = 0; row < remote_object.parent->parent->children.size(); ++row) {
|
||||
if (&remote_object.parent->parent->children[row] == remote_object.parent)
|
||||
return create_index(row, 0, remote_object.parent);
|
||||
}
|
||||
|
|
|
@ -71,7 +71,7 @@ void RemoteProcess::handle_get_all_objects_response(const JsonObject& response)
|
|||
remote_objects.append(move(remote_object));
|
||||
}
|
||||
|
||||
for (int i = 0; i < remote_objects.size(); ++i) {
|
||||
for (size_t i = 0; i < remote_objects.size(); ++i) {
|
||||
auto& remote_object = remote_objects.ptr_at(i);
|
||||
auto* parent = objects_by_address.get(remote_object->parent_address).value_or(nullptr);
|
||||
if (!parent) {
|
||||
|
|
|
@ -108,7 +108,7 @@ void Profile::rebuild_tree()
|
|||
Vector<NonnullRefPtr<ProfileNode>> roots;
|
||||
|
||||
auto find_or_create_root = [&roots](const String& symbol, u32 address, u32 offset, u64 timestamp) -> ProfileNode& {
|
||||
for (int i = 0; i < roots.size(); ++i) {
|
||||
for (size_t i = 0; i < roots.size(); ++i) {
|
||||
auto& root = roots[i];
|
||||
if (root->symbol() == symbol) {
|
||||
return root;
|
||||
|
@ -152,12 +152,12 @@ void Profile::rebuild_tree()
|
|||
auto for_each_frame = [&]<typename Callback>(Callback callback)
|
||||
{
|
||||
if (!m_inverted) {
|
||||
for (int i = 0; i < sample.frames.size(); ++i) {
|
||||
for (size_t i = 0; i < sample.frames.size(); ++i) {
|
||||
if (callback(sample.frames.at(i)) == IterationDecision::Break)
|
||||
break;
|
||||
}
|
||||
} else {
|
||||
for (int i = sample.frames.size() - 1; i >= 0; --i) {
|
||||
for (size_t i = sample.frames.size() - 1; i >= 0; --i) {
|
||||
if (callback(sample.frames.at(i)) == IterationDecision::Break)
|
||||
break;
|
||||
}
|
||||
|
|
|
@ -63,7 +63,7 @@ public:
|
|||
|
||||
ProfileNode& find_or_create_child(const String& symbol, u32 address, u32 offset, u64 timestamp)
|
||||
{
|
||||
for (int i = 0; i < m_children.size(); ++i) {
|
||||
for (size_t i = 0; i < m_children.size(); ++i) {
|
||||
auto& child = m_children[i];
|
||||
if (child->symbol() == symbol) {
|
||||
return child;
|
||||
|
|
|
@ -62,7 +62,7 @@ GUI::ModelIndex ProfileModel::parent_index(const GUI::ModelIndex& index) const
|
|||
|
||||
// NOTE: If the parent has no parent, it's a root, so we have to look among the roots.
|
||||
if (!node.parent()->parent()) {
|
||||
for (int row = 0; row < m_profile.roots().size(); ++row) {
|
||||
for (size_t row = 0; row < m_profile.roots().size(); ++row) {
|
||||
if (m_profile.roots()[row].ptr() == node.parent()) {
|
||||
return create_index(row, index.column(), node.parent());
|
||||
}
|
||||
|
@ -71,7 +71,7 @@ GUI::ModelIndex ProfileModel::parent_index(const GUI::ModelIndex& index) const
|
|||
return {};
|
||||
}
|
||||
|
||||
for (int row = 0; row < node.parent()->parent()->children().size(); ++row) {
|
||||
for (size_t row = 0; row < node.parent()->parent()->children().size(); ++row) {
|
||||
if (node.parent()->parent()->children()[row].ptr() == node.parent())
|
||||
return create_index(row, index.column(), node.parent());
|
||||
}
|
||||
|
|
|
@ -171,7 +171,7 @@ void VBForm::keydown_event(GUI::KeyEvent& event)
|
|||
update();
|
||||
return;
|
||||
}
|
||||
int selected_widget_index = 0;
|
||||
size_t selected_widget_index = 0;
|
||||
for (; selected_widget_index < m_widgets.size(); ++selected_widget_index) {
|
||||
if (&m_widgets[selected_widget_index] == *m_selected_widgets.begin())
|
||||
break;
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue