convert ASCII TABs to ASCII SPACEs

Converted all ASCII tabs to ASCII spaces using a 8 character
tab stop, for all files, except for all Makefiles (plus rpm.mk).
The `git diff -w` reports no changes.
This commit is contained in:
Landon Curt Noll
2024-07-11 22:03:52 -07:00
parent fe9cefe6ef
commit db77e29a23
631 changed files with 90607 additions and 90600 deletions

View File

@@ -5,9 +5,9 @@ SYNOPSIS
list([x, [x, ... ]])
TYPES
x any, &any
x any, &any
return list
return list
DESCRIPTION
This function returns a list that is composed of the arguments x.
@@ -18,24 +18,24 @@ DESCRIPTION
The function 'list' creates a list with possible initial elements.
For example,
x = list(4, 6, 7);
x = list(4, 6, 7);
creates a list in the variable x of three elements, in the order
4, 6, and 7.
The 'push' and 'pop' functions insert or remove an element from
the beginning of the list. The 'append' and 'remove' functions
the beginning of the list. The 'append' and 'remove' functions
insert or remove an element from the end of the list. The 'insert'
and 'delete' functions insert or delete an element from the middle
(or ends) of a list. The functions which insert elements return
the null value, but the functions which remove an element return
the element as their value. The 'size' function returns the number
the element as their value. The 'size' function returns the number
of elements in the list.
Note that these functions manipulate the actual list argument,
instead of returning a new list. Thus in the example:
push(x, 9);
push(x, 9);
x becomes a list of four elements, in the order 9, 4, 6, and 7.
Lists can be copied by assigning them to another variable.
@@ -43,11 +43,11 @@ DESCRIPTION
An arbitrary element of a linked list can be accessed by using the
double-bracket operator. The beginning of the list has index 0.
Thus in the new list x above, the expression x[[0]] returns the
value of the first element of the list, which is 9. Note that this
value of the first element of the list, which is 9. Note that this
indexing does not remove elements from the list.
Since lists are doubly linked in memory, random access to arbitrary
elements can be slow if the list is large. However, for each list
elements can be slow if the list is large. However, for each list
a pointer is kept to the latest indexed element, thus relatively
sequential accesses to the elements in a list will not be slow.
@@ -65,7 +65,7 @@ EXAMPLE
[[2]] = 4i
; list()
list (0 elements, 0 nonzero)
list (0 elements, 0 nonzero)
LIMITS
none
@@ -84,7 +84,7 @@ SEE ALSO
##
## Calc is distributed in the hope that it will be useful, but WITHOUT
## ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
## or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General
## or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General
## Public License for more details.
##
## A copy of version 2.1 of the GNU Lesser General Public License is
@@ -92,8 +92,8 @@ SEE ALSO
## received a copy with calc; if not, write to Free Software Foundation, Inc.
## 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
##
## Under source code control: 1994/03/19 03:13:19
## File existed as early as: 1994
## Under source code control: 1994/03/19 03:13:19
## File existed as early as: 1994
##
## chongo <was here> /\oo/\ http://www.isthe.com/chongo/
## Share and enjoy! :-) http://www.isthe.com/chongo/tech/comp/calc/
## chongo <was here> /\oo/\ http://www.isthe.com/chongo/
## Share and enjoy! :-) http://www.isthe.com/chongo/tech/comp/calc/