summaryrefslogtreecommitdiff
path: root/src/map/map.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/map/map.h')
-rw-r--r--src/map/map.h6
1 files changed, 3 insertions, 3 deletions
diff --git a/src/map/map.h b/src/map/map.h
index 539b02ed8..73ef4bb41 100644
--- a/src/map/map.h
+++ b/src/map/map.h
@@ -579,9 +579,9 @@ struct map_data {
"Algorithms in Java, Parts 1-4" 3.18, Robert Sedgewick
Map is divided into squares, called blocks (side length = BLOCK_SIZE).
For each block there is a linked list of objects in that block (block_list).
- Array provides capability to access immediately the set of objects close
+ Array provides capability to access immediately the set of objects close
to a given object.
- The linked lists provide the flexibility to store the objects without
+ The linked lists provide the flexibility to store the objects without
knowing ahead how many objects fall into each block.
*/
struct block_list **block; // Grid array of block_lists containing only non-BL_MOB objects
@@ -796,7 +796,7 @@ struct map_cache_map_info {
/*=====================================
-* Interface : map.h
+* Interface : map.h
* Generated by HerculesInterfaceMaker
* created by Susu
*-------------------------------------*/