m/grafX2
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Correct some spelling mistakes

Browse Source 
Automaticaly --> Automatically
Invalide --> Invalid
Strech --> Stretch
allows to --> allows one to
attachement --> attachment
contraints --> constraints
inconsistant --> inconsistent
occured --> occurred
occurences --> occurrences
permits to --> permits one to
postion --> position
regularily --> regularly
transfered --> transferred
This commit is contained in:
Nic Soudée
2019-01-24 08:32:58 -05:00
parent fc2839a3b6
commit 228e651b4f
13 changed files with 77 additions and 77 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
src/tiles.c
View File

@@ -249,7 +249,7 @@ void Tilemap_update(void)
}
if (ref_tile<tile)
{
// New occurence of a known tile
// New occurrence of a known tile
// Insert at the end. classic doubly-linked-list.
int last_tile=Main.tilemap[ref_tile].Previous;
Main.tilemap[tile].Previous=last_tile;
@@ -272,7 +272,7 @@ void Tilemap_update(void)
}
if (ref_tile<tile)
{
// New occurence of a known tile
// New occurrence of a known tile
// Insert at the end. classic doubly-linked-list.
int last_tile=Main.tilemap[ref_tile].Previous;
Main.tilemap[tile].Previous=last_tile;
@@ -296,7 +296,7 @@ void Tilemap_update(void)
}
if (ref_tile<tile)
{
// New occurence of a known tile
// New occurrence of a known tile
// Insert at the end. classic doubly-linked-list.
int last_tile=Main.tilemap[ref_tile].Previous;
Main.tilemap[tile].Previous=last_tile;
@@ -320,7 +320,7 @@ void Tilemap_update(void)
}
if (ref_tile<tile)
{
// New occurence of a known tile
// New occurrence of a known tile
// Insert at the end. classic doubly-linked-list.
int last_tile=Main.tilemap[ref_tile].Previous;
Main.tilemap[tile].Previous=last_tile;