No reference for int and float

This commit is contained in:
Benau 2016-02-04 09:51:59 +08:00
parent 4cbb31b8e5
commit 38eeddd4e8
4 changed files with 7 additions and 7 deletions

View File

@ -72,7 +72,7 @@ public:
// Not needed to create any physics for a ghost kart.
virtual void createPhysics() {}
// ------------------------------------------------------------------------
const float& getSuspensionLength(int index, int wheel) const
const float getSuspensionLength(int index, int wheel) const
{ return m_all_physic_info[index].m_suspension_length[wheel]; }
// ------------------------------------------------------------------------
}; // GhostKart

View File

@ -157,23 +157,23 @@ public:
m_blue_score_times : m_red_score_times);
}
// ------------------------------------------------------------------------
const int& getKartNode(unsigned int kart_id) const
const int getKartNode(unsigned int kart_id) const
{ return m_kart_on_node[kart_id]; }
// ------------------------------------------------------------------------
const int& getBallNode() const
const int getBallNode() const
{ return m_ball_on_node; }
// ------------------------------------------------------------------------
const Vec3& getBallPosition() const
{ return m_ball_position; }
// ------------------------------------------------------------------------
const int& getGoalNode(SoccerTeam team) const
const int getGoalNode(SoccerTeam team) const
{
return (team == SOCCER_TEAM_BLUE ? m_blue_goal_node : m_red_goal_node);
}
// ------------------------------------------------------------------------
bool isCorrectGoal(unsigned int kart_id, bool first_goal) const;
// ------------------------------------------------------------------------
const int& getDefender(SoccerTeam team) const
const int getDefender(SoccerTeam team) const
{
return (team == SOCCER_TEAM_BLUE ? m_blue_defender : m_red_defender);
}

View File

@ -216,7 +216,7 @@ int BattleGraph::pointToNode(const int cur_node,
// -----------------------------------------------------------------------------
const int & BattleGraph::getNextShortestPathPoly(int i, int j) const
const int BattleGraph::getNextShortestPathPoly(int i, int j) const
{
if (i == BattleGraph::UNKNOWN_POLY || j == BattleGraph::UNKNOWN_POLY)
return BattleGraph::UNKNOWN_POLY;

View File

@ -120,7 +120,7 @@ public:
/** Returns the next polygon on the shortest path from i to j.
* Note: m_parent_poly[j][i] contains the parent of i on path from j to i,
* which is the next node on the path from i to j (undirected graph) */
const int & getNextShortestPathPoly(int i, int j) const;
const int getNextShortestPathPoly(int i, int j) const;
const std::vector < std::pair<const Item*, int> >& getItemList()
{ return m_items_on_graph; }