Strip trailing spaces

doc/jsbignum.texi

@@ -289,7 +289,7 @@ precision.
 Otherwise, the number is rounded to nearest with ties to even using
 the global precision. It is then converted to string using the minimum
 number of digits so that its conversion back to a floating point using
-the global precision and round to nearest gives the same number. 
+the global precision and round to nearest gives the same number.
 
 @end itemize
 

doc/quickjs.texi

@@ -160,7 +160,7 @@ Options are:
 @table @code
 @item -c
 Only output bytecode in a C file. The default is to output an executable file.
-@item -e 
+@item -e
 Output @code{main()} and bytecode in a C file. The default is to output an
 executable file.
 @item -o output
@@ -489,7 +489,7 @@ optional properties:
   to be UTF-8 encoded.
 
   @item full
-  
+
   Boolean (default = false). If true, return the an object contains
   the properties @code{response} (response content),
   @code{responseHeaders} (headers separated by CRLF), @code{status}
@@ -596,7 +596,7 @@ Available exports:
 Open a file. Return a handle or < 0 if error.
 
 @item O_RDONLY
-@item O_WRONLY        
+@item O_WRONLY
 @item O_RDWR
 @item O_APPEND
 @item O_CREAT
@@ -734,7 +734,7 @@ object containing optional parameters:
   terminated. In this case, @code{exec} return the exit code if positive
   or the negated signal number if the process was interrupted by a
   signal. If false, do not block and return the process id of the child.
-  
+
   @item usePath
   Boolean (default = true). If true, the file is searched in the
   @code{PATH} environment variable.
@@ -758,7 +758,7 @@ object containing optional parameters:
   @item uid
   Integer. If present, the process uid with @code{setuid}.
 
-  @item gid 
+  @item gid
   Integer. If present, the process gid with @code{setgid}.
 
   @end table
@@ -829,7 +829,7 @@ The worker instances have the following properties:
 
   @table @code
   @item postMessage(msg)
-  
+
   Send a message to the corresponding worker. @code{msg} is cloned in
   the destination worker using an algorithm similar to the @code{HTML}
   structured clone algorithm. @code{SharedArrayBuffer} are shared
@@ -972,7 +972,7 @@ The compiler generates bytecode directly with no intermediate
 representation such as a parse tree, hence it is very fast. Several
 optimizations passes are done over the generated bytecode.
 
-A stack-based bytecode was chosen because it is simple and generates 
+A stack-based bytecode was chosen because it is simple and generates
 compact code.
 
 For each function, the maximum stack size is computed at compile time so that