3 Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com>
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU Lesser General Public License as published by
7 the Free Software Foundation; either version 2.1 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public License along
16 with this program; if not, write to the Free Software Foundation, Inc.,
17 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
24 #include "util/container.h"
34 // TODO: Move unspreadLight and spreadLight from VoxelManipulator to here
36 void setLight(VoxelManipulator &v, VoxelArea a, u8 light,
37 INodeDefManager *ndef);
39 void clearLightAndCollectSources(VoxelManipulator &v, VoxelArea a,
40 enum LightBank bank, INodeDefManager *ndef,
41 std::set<v3s16> & light_sources,
42 std::map<v3s16, u8> & unlight_from);
44 struct SunlightPropagateResult
46 bool bottom_sunlight_valid;
48 SunlightPropagateResult(bool bottom_sunlight_valid_):
49 bottom_sunlight_valid(bottom_sunlight_valid_)
53 SunlightPropagateResult propagateSunlight(VoxelManipulator &v, VoxelArea a,
54 bool inexistent_top_provides_sunlight,
55 std::set<v3s16> & light_sources,
56 INodeDefManager *ndef);
59 * Updates the lighting on the map.
60 * The result will be correct only if
61 * no nodes were changed except the given ones.
62 * Before calling this procedure make sure that all new nodes on
63 * the map have zero light level!
65 * \param oldnodes contains the MapNodes that were replaced by the new
66 * MapNodes and their positions
67 * \param modified_blocks output, contains all map blocks that
68 * the function modified
70 void update_lighting_nodes(
72 std::vector<std::pair<v3s16, MapNode> > &oldnodes,
73 std::map<v3s16, MapBlock*> &modified_blocks);
76 * Updates borders of the given mapblock.
77 * Only updates if the block was marked with incomplete
78 * lighting and the neighbor is also loaded.
80 * \param block the block to update
81 * \param modified_blocks output, contains all map blocks that
82 * the function modified
84 void update_block_border_lighting(Map *map, MapBlock *block,
85 std::map<v3s16, MapBlock*> &modified_blocks);
88 * Copies back nodes from a voxel manipulator
89 * to the map and updates lighting.
90 * For server use only.
92 * \param modified_blocks output, contains all map blocks that
93 * the function modified
95 void blit_back_with_light(ServerMap *map, MMVManip *vm,
96 std::map<v3s16, MapBlock*> *modified_blocks);
99 * Corrects the light in a map block.
100 * For server use only.
102 * \param block the block to update
104 void repair_block_light(ServerMap *map, MapBlock *block,
105 std::map<v3s16, MapBlock*> *modified_blocks);
108 * This class iterates trough voxels that intersect with
109 * a line. The collision detection does not see nodeboxes,
110 * every voxel is a cube and is returned.
111 * This iterator steps to all nodes exactly once.
113 struct VoxelLineIterator
116 //! Starting position of the line in world coordinates.
117 v3f m_start_position;
118 //! Direction and length of the line in world coordinates.
121 * Each component stores the next smallest positive number, by
122 * which multiplying the line's vector gives a vector that ends
123 * on the intersection of two nodes.
125 v3f m_next_intersection_multi { 10000.0f, 10000.0f, 10000.0f };
127 * Each component stores the smallest positive number, by which
128 * m_next_intersection_multi's components can be increased.
130 v3f m_intersection_multi_inc { 10000.0f, 10000.0f, 10000.0f };
132 * Direction of the line. Each component can be -1 or 1 (if a
133 * component of the line's vector is 0, then there will be 1).
135 v3s16 m_step_directions { 1, 1, 1 };
136 //! Position of the current node.
137 v3s16 m_current_node_pos;
138 //! Index of the current node
139 s16 m_current_index = 0;
140 //! Position of the start node.
141 v3s16 m_start_node_pos;
142 //! Index of the last node
146 * Creates a voxel line iterator with the given line.
147 * @param start_position starting point of the line
148 * in voxel coordinates
149 * @param line_vector length and direction of the
150 * line in voxel coordinates. start_position+line_vector
151 * is the end of the line
153 VoxelLineIterator(const v3f &start_position,const v3f &line_vector);
156 * Steps to the next voxel.
157 * Updates m_current_node_pos and
158 * m_previous_node_pos.
159 * Note that it works even if hasNext() is false,
160 * continuing the line as a ray.
165 * Returns true if the next voxel intersects the given line.
167 inline bool hasNext() const
169 return m_current_index < m_last_index;
173 * Returns how many times next() must be called until
174 * voxel==m_current_node_pos.
175 * If voxel does not intersect with the line,
176 * the result is undefined.
178 s16 getIndex(v3s16 voxel);
181 } // namespace voxalgo