diff options
| author | Chris Oelmueller <chris.oelmueller@gmail.com> | 2013-07-22 23:33:29 +0200 |
|---|---|---|
| committer | Chris Campbell <chriscampbell89@gmail.com> | 2013-07-23 17:27:50 +0100 |
| commit | 1e8a74ea0b0e105d33382862bf59a8313bd81fa0 (patch) | |
| tree | cc43871811deaccbecb55794c39735d433aadac1 /crawl-ref/source/spl-util.cc | |
| parent | 925c3d30d6b0207b59945da8e90a9150620cd866 (diff) | |
| download | crawl-ref-1e8a74ea0b0e105d33382862bf59a8313bd81fa0.tar.gz crawl-ref-1e8a74ea0b0e105d33382862bf59a8313bd81fa0.zip | |
Fix lots of typos
Diffstat (limited to 'crawl-ref/source/spl-util.cc')
| -rw-r--r-- | crawl-ref/source/spl-util.cc | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/crawl-ref/source/spl-util.cc b/crawl-ref/source/spl-util.cc index 77f7df0b5b..5f66de5c89 100644 --- a/crawl-ref/source/spl-util.cc +++ b/crawl-ref/source/spl-util.cc @@ -634,7 +634,7 @@ int apply_random_around_square(cell_func cf, const coord_def& where, // // 2) Assume the distribution is uniform at n = m+k. // (ie. the probablity that any of the found elements - // was chosen = m / (m+k) (the slots are symetric, + // was chosen = m / (m+k) (the slots are symmetric, // so it's the sum of the probabilities of being in // any of them)). // @@ -665,8 +665,8 @@ int apply_random_around_square(cell_func cf, const coord_def& where, // just don't care about the non-chosen slots enough // to store them, so it might look like the item // automatically takes the new slot when not chosen - // (although, by symetry all the non-chosen slots are - // the same... and similarly, by symetry, all chosen + // (although, by symmetry all the non-chosen slots are + // the same... and similarly, by symmetry, all chosen // slots are the same). // // Yes, that's a long comment for a short piece of |