diff options
author | rubidium <rubidium@openttd.org> | 2009-03-15 00:32:18 +0000 |
---|---|---|
committer | rubidium <rubidium@openttd.org> | 2009-03-15 00:32:18 +0000 |
commit | b25a4f8231f3ded44038ea454a3d4c6a2dc9217d (patch) | |
tree | 776122508c686680b9c97f37ba3cb92ef905d67f /src/yapf/nodelist.hpp | |
parent | d72273d1f3b55df0e301408d630f24ef92ea8479 (diff) | |
download | openttd-b25a4f8231f3ded44038ea454a3d4c6a2dc9217d.tar.xz |
(svn r15718) -Cleanup: apply some comment coding style on the rest of the sources too
Diffstat (limited to 'src/yapf/nodelist.hpp')
-rw-r--r-- | src/yapf/nodelist.hpp | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/yapf/nodelist.hpp b/src/yapf/nodelist.hpp index 3ecc91dbb..07fed8df0 100644 --- a/src/yapf/nodelist.hpp +++ b/src/yapf/nodelist.hpp @@ -74,11 +74,11 @@ public: /** notify the nodelist, that we don't want to discard the given node */ FORCEINLINE void FoundBestNode(Titem_& item) { - // for now it is enough to invalidate m_new_node if it is our given node + /* for now it is enough to invalidate m_new_node if it is our given node */ if (&item == m_new_node) { m_new_node = NULL; } - // TODO: do we need to store best nodes found in some extra list/array? Probably not now. + /* TODO: do we need to store best nodes found in some extra list/array? Probably not now. */ } /** insert given item as open node (into m_open and m_open_queue) */ @@ -86,7 +86,7 @@ public: { assert(m_closed.Find(item.GetKey()) == NULL); m_open.Push(item); - // TODO: check if m_open_queue is not full + /* TODO: check if m_open_queue is not full */ assert(!m_open_queue.IsFull()); m_open_queue.Push(item); if (&item == m_new_node) { |