Changeset - r23521:26cb73a2624c
[Not reviewed]
master
0 5 0
Henry Wilson - 6 years ago 2018-09-23 15:43:00
m3henry@googlemail.com
Codechange: Replaced SmallVector::Resize() with std::vector::resize()
5 files changed with 4 insertions and 13 deletions:
0 comments (0 inline, 0 general)
src/core/smallstack_type.hpp
Show inline comments
 
@@ -74,7 +74,7 @@ private:
 
		}
 

	
 
		if (index >= this->data.size() && index < Tmax_size) {
 
			this->data.Resize(index + 1);
 
			this->data.resize(index + 1);
 
		}
 
		return index;
 
	}
src/core/smallvec_type.hpp
Show inline comments
 
@@ -98,15 +98,6 @@ public:
 
	}
 

	
 
	/**
 
	 * Set the size of the vector, effectively truncating items from the end or appending uninitialised ones.
 
	 * @param num_items Target size.
 
	 */
 
	inline void Resize(uint num_items)
 
	{
 
		std::vector<T>::resize(num_items);
 
	}
 

	
 
	/**
 
	 * Insert a new item at a specific position into the vector, moving all following items.
 
	 * @param item Position at which the new item should be inserted
 
	 * @return pointer to the new item
src/linkgraph/linkgraph.cpp
Show inline comments
 
@@ -281,7 +281,7 @@ void LinkGraph::Init(uint size)
 
{
 
	assert(this->Size() == 0);
 
	this->edges.Resize(size, size);
 
	this->nodes.Resize(size);
 
	this->nodes.resize(size);
 

	
 
	for (uint i = 0; i < size; ++i) {
 
		this->nodes[i].Init();
src/linkgraph/linkgraphjob.cpp
Show inline comments
 
@@ -179,7 +179,7 @@ LinkGraphJob::~LinkGraphJob()
 
void LinkGraphJob::Init()
 
{
 
	uint size = this->Size();
 
	this->nodes.Resize(size);
 
	this->nodes.resize(size);
 
	this->edges.Resize(size, size);
 
	for (uint i = 0; i < size; ++i) {
 
		this->nodes[i].Init(this->link_graph[i].Supply());
src/vehicle_gui.cpp
Show inline comments
 
@@ -482,7 +482,7 @@ struct RefitWindow : public Window {
 
								/* 0xFF item is in front, other subtypes are sorted. So just truncate the list in the right spot */
 
								for (uint i = 1; i < l.size(); i++) {
 
									if (l[i].subtype >= refit_cyc) {
 
										l.Resize(i);
 
										l.resize(i);
 
										break;
 
									}
 
								}
0 comments (0 inline, 0 general)