diff options
| author | rubidium <rubidium@openttd.org> | 2006-09-04 20:40:33 +0000 |
|---|---|---|
| committer | rubidium <rubidium@openttd.org> | 2006-09-04 20:40:33 +0000 |
| commit | 63687763e9680663e68754b47ee9f1511641faf8 (patch) | |
| tree | b1e52d993ce60e919358d998b36ea08adfe26cba /variables.h | |
| parent | a7cfb80c40d9a4c544ece10872fd3808f9f59f8d (diff) | |
| download | openttd-63687763e9680663e68754b47ee9f1511641faf8.tar.xz | |
(svn r6381) -Cleanup: make the '/* */' comments that span multiple lines more uniform.
-Cleanup: whitespace alignment of a few tables.
Diffstat (limited to 'variables.h')
| -rw-r--r-- | variables.h | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/variables.h b/variables.h index 44b3750d9..209bf134b 100644 --- a/variables.h +++ b/variables.h @@ -184,16 +184,16 @@ typedef struct Patches { bool ai_in_multiplayer; // Do we allow AIs in multiplayer /* - * New Path Finding - */ + * New Path Finding + */ bool new_pathfinding_all; /* Use the newest pathfinding algorithm for all */ /** - * The maximum amount of search nodes a single NPF run should take. This - * limit should make sure performance stays at acceptable levels at the cost - * of not being perfect anymore. This will probably be fixed in a more - * sophisticated way sometime soon - */ + * The maximum amount of search nodes a single NPF run should take. This + * limit should make sure performance stays at acceptable levels at the cost + * of not being perfect anymore. This will probably be fixed in a more + * sophisticated way sometime soon + */ uint32 npf_max_search_nodes; uint32 npf_rail_firstred_penalty; /* The penalty for when the first signal is red (and it is not an exit or combo signal) */ |