diff options
| author | 2015-06-24 07:36:50 +0200 | |
|---|---|---|
| committer | 2015-06-24 07:36:50 +0200 | |
| commit | d1583b9850d9fb45470648a515eb734e05fd926f (patch) | |
| tree | 33a4d9934bd2ff6c41526abe0ba06c1d1ea73eb6 /src/emu/netlist/plib/plists.h | |
| parent | 03a5bfa56fa4af400f6b9fb07a5e1333aa8fa52f (diff) | |
Cleanups and version bumpmame0163
Diffstat (limited to 'src/emu/netlist/plib/plists.h')
| -rw-r--r-- | src/emu/netlist/plib/plists.h | 17 |
1 files changed, 8 insertions, 9 deletions
diff --git a/src/emu/netlist/plib/plists.h b/src/emu/netlist/plib/plists.h index 4193f4956cc..0f71a35c9e4 100644 --- a/src/emu/netlist/plib/plists.h +++ b/src/emu/netlist/plib/plists.h @@ -97,7 +97,7 @@ public: plist_t() : std::vector<_ListClass>() {} plist_t(const int numElements) : std::vector<_ListClass>(numElements) {} - void add(const _ListClass &elem) { this->push_back(elem); } + void add(const _ListClass &elem) { this->push_back(elem); } void clear_and_free() { for (_ListClass *i = this->data(); i < this->data() + this->size(); i++) @@ -106,7 +106,7 @@ public: } this->clear(); } - bool contains(const _ListClass &elem) const + bool contains(const _ListClass &elem) const { for (const _ListClass *i = this->data(); i < this->data() + this->size(); i++) { @@ -116,7 +116,7 @@ public: return false; } - void remove(const _ListClass &elem) + void remove(const _ListClass &elem) { for (int i = 0; i < this->size(); i++) { @@ -127,12 +127,12 @@ public: } } } - void remove_at(const int pos) + void remove_at(const int pos) { this->erase(this->begin() + pos); } - int indexof(const _ListClass &elem) const + int indexof(const _ListClass &elem) const { for (int i = 0; i < this->size(); i++) { @@ -539,7 +539,6 @@ public: pstring_list_t(const pstring &str, const pstring &onstr, bool ignore_empty = false) : plist_t<pstring>() { - int p = 0; int pn; @@ -607,9 +606,9 @@ static inline void psort_list(Class &sl) { for(int i = 0; i < (int) sl.size() - 1; i++) { - for(int j = i + 1; j < sl.size(); j++) - if(sl[i] > sl[j]) - std::swap(sl[i], sl[j]); + for(int j = i + 1; j < sl.size(); j++) + if(sl[i] > sl[j]) + std::swap(sl[i], sl[j]); } } |
