[gnuastro-commits] master cab2c04 2/2: Fixed many small typos in the book, Warp and library

[Mohammad Akhlaghi]

branch: master
commit cab2c04a863766f07ffb073ee5eda30da56d7e49
Author: Pedram Ashofteh Ardakani <pedramardakani@pm.me>
Commit: Mohammad Akhlaghi <mohammad@akhlaghi.org>

    Fixed many small typos in the book, Warp and library
    
    Until now, some minor typos existed in various parts of the some of the
    codes that I was reading and had kept in a separate branch.
    
    With this commit, that branch has been 'squashed' into a single commit to
    be ready for merging into 'master'.
---
 bin/warp/warp.c   | 4 ++--
 doc/gnuastro.texi | 8 ++++----
 lib/checkset.c    | 2 +-
 lib/pointer.c     | 2 +-
 4 files changed, 8 insertions(+), 8 deletions(-)

diff --git a/bin/warp/warp.c b/bin/warp/warp.c
index eca744d..1f640bc 100644
--- a/bin/warp/warp.c
+++ b/bin/warp/warp.c
@@ -75,7 +75,7 @@ along with Gnuastro. If not, see 
<http://www.gnu.org/licenses/>.
 
 
 
-/* Similar to 'nearestint_halflower' but:
+/* Similar to 'nearestint_halfhigher' but:
 
    nearestint_halflower(0.5f) --> 0.0f;
  */
@@ -183,7 +183,7 @@ warp_onthread(void *inparam)
       for(y=ystart;y<yend;++y)
         {
           /* If the pixel isn't in the image (note that the pixel
-             coordinates start from 1), contine to next. Note that the
+             coordinates start from 1), skip this pixel. Note that the
              pixel polygon should be counter clockwise. */
           if( y<1 || y>is0 ) continue;
           pcrn[1]=y-0.5f;      pcrn[3]=y-0.5f;
diff --git a/doc/gnuastro.texi b/doc/gnuastro.texi
index df43731..b546de7 100644
--- a/doc/gnuastro.texi
+++ b/doc/gnuastro.texi
@@ -12526,7 +12526,7 @@ For a concave polygon it will sort the vertices 
correctly, however for a convex
 @cindex Polygons, Concave
 Polygons come in two classes: convex and concave (or generally, non-convex!), 
see below for a demonstration.
 Convex polygons are those where all inner angles are less than 180 degrees.
-By contrast, a convex polygon is one where an inner angle may be more than 180 
degrees.
+By contrast, a concave polygon is one where an inner angle may be more than 
180 degrees.
 
 @example
             Concave Polygon        Convex Polygon
@@ -15688,7 +15688,7 @@ The full list of modular warpings and the other options 
particular to Warp are d
 The values to the warping options (modular warpings as well as 
@option{--matrix}), are a sequence of at least one number.
 Each number in this sequence is separated from the next by a comma (@key{,}).
 Each number can also be written as a single fraction (with a forward-slash 
@key{/} between the numerator and denominator).
-Space and Tab characters arepermitted between any two numbers, just don't 
forget to quote the whole value.
+Space and Tab characters are permitted between any two numbers, just don't 
forget to quote the whole value.
 Otherwise, the value will not be fully passed onto the option.
 See the examples above as a demonstration.
 
@@ -15762,7 +15762,7 @@ The value(s) can also be written (on the command-line 
or in configuration files)
 @item -m STR
 @itemx --matrix=STR
 The warp/transformation matrix.
-All the elements in this matrix must be separated by comas(@key{,}) characters 
and as described above, you can also use fractions (a forward-slash between two 
numbers).
+All the elements in this matrix must be separated by commas(@key{,}) 
characters and as described above, you can also use fractions (a forward-slash 
between two numbers).
 The transformation matrix can be either a 2 by 2 (4 numbers), or a 3 by 3 (9 
numbers) array.
 In the former case (if a 2 by 2 matrix is given), then it is put into a 3 by 3 
matrix (see @ref{Warping basics}).
 
@@ -31184,7 +31184,7 @@ This is just intended to demonstrate how to use the 
@code{array} pointer of
 in real datasets you may also have blank pixels. In such cases, this
 program will return a NaN value (see @ref{Blank pixels}). So for general
 statistical information of a dataset, it is much better to use Gnuastro's
-@ref{Statistics} program which can deal with blank pixels any many other
+@ref{Statistics} program which can deal with blank pixels and many other
 issues in a generic dataset.
 
 @example
diff --git a/lib/checkset.c b/lib/checkset.c
index c8e367a..9aea0de 100644
--- a/lib/checkset.c
+++ b/lib/checkset.c
@@ -335,7 +335,7 @@ gal_checkset_malloc_cat(char *inname, char *toappend)
 
 
 /* Copy the input string to the output (and also allocate the
-   output. */
+   output). */
 void
 gal_checkset_allocate_copy(const char *arg, char **copy)
 {
diff --git a/lib/pointer.c b/lib/pointer.c
index 75f6078..18dee12 100644
--- a/lib/pointer.c
+++ b/lib/pointer.c
@@ -259,7 +259,7 @@ gal_pointer_allocate_ram_or_mmap(uint8_t type, size_t size, 
int clear,
         out=gal_pointer_mmap_allocate(type, size, clear,
                                       mmapname, quietmmap);
 
-      /* The 'errno' is re-set to zero just incase 'malloc'
+      /* The 'errno' is re-set to zero just in case 'malloc'
          changed it, which may cause problems later. */
       errno=0;
     }