Mercurial > hg > openttd
changeset 14668:886df67ec9a2 draft
(svn r19247) -Codechange: Rename methods to fit better to common style (skidd13)
| author | yexo <yexo@openttd.org> |
|---|---|
| date | Thu, 25 Feb 2010 11:52:04 +0000 |
| parents | 2ebd8af64333 |
| children | 7dfc887eabce |
| files | src/misc/binaryheap.hpp src/pathfinder/yapf/nodelist.hpp |
| diffstat | 2 files changed, 7 insertions(+), 7 deletions(-) [+] |
line wrap: on
line diff
--- a/src/misc/binaryheap.hpp +++ b/src/misc/binaryheap.hpp @@ -148,7 +148,7 @@ * * @return The number of items in the queue */ - FORCEINLINE uint Size() const { return this->items; } + FORCEINLINE uint Length() const { return this->items; } /** * Test if the priority queue is empty. @@ -192,7 +192,7 @@ * * @param new_item The pointer to the new item */ - FORCEINLINE void Push(T *new_item) + FORCEINLINE void Include(T *new_item) { if (this->IsFull()) { this->capacity *= 2; @@ -233,7 +233,7 @@ * * @param index The position of the item in the heap */ - FORCEINLINE void RemoveByIdx(uint index) + FORCEINLINE void Remove(uint index) { if (index < this->items) { assert(index != 0); @@ -261,7 +261,7 @@ * @param item The reference to the item * @return The index of the item or zero if not found */ - FORCEINLINE uint FindLinear(const T &item) const + FORCEINLINE uint FindIndex(const T &item) const { if (this->IsEmpty()) return 0; for (T **ppI = this->data + 1, **ppLast = ppI + this->items; ppI <= ppLast; ppI++) {
--- a/src/pathfinder/yapf/nodelist.hpp +++ b/src/pathfinder/yapf/nodelist.hpp @@ -93,7 +93,7 @@ { assert(m_closed.Find(item.GetKey()) == NULL); m_open.Push(item); - m_open_queue.Push(&item); + m_open_queue.Include(&item); if (&item == m_new_node) { m_new_node = NULL; } @@ -130,8 +130,8 @@ FORCEINLINE Titem_& PopOpenNode(const Key& key) { Titem_& item = m_open.Pop(key); - int idxPop = m_open_queue.FindLinear(item); - m_open_queue.RemoveByIdx(idxPop); + uint idxPop = m_open_queue.FindIndex(item); + m_open_queue.Remove(idxPop); return item; }