[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
guile/guile-core/doc ChangeLog expect.texi intr...
|
From: |
Martin Grabmueller |
|
Subject: |
guile/guile-core/doc ChangeLog expect.texi intr... |
|
Date: |
Wed, 16 May 2001 11:08:13 -0700 |
CVSROOT: /cvs
Module name: guile
Changes by: Martin Grabmueller <address@hidden> 01/05/16 11:08:12
Modified files:
guile-core/doc : ChangeLog expect.texi intro.texi posix.texi
repl-modules.texi scheme-binding.texi
scheme-control.texi scheme-data.texi
scheme-procedures.texi scheme-utility.texi
scripts.texi srfi-modules.texi
Log message:
* scripts.texi (Invoking Guile): Added docs for --use-srfi.
* expect.texi, repl-modules.texi: Start the chapters with a new
page.
* srfi-modules.texi (SRFI-0): Added note about supported feature
identifiers and an example. Start the chapter with a new page.
* srfi-modules.texi, scheme-data.texi, scheme-control.texi,
scheme-binding.texi, repl-modules.texi, posix.texi, intro.texi,
scheme-utility.texi: Change `--' to `-' throughout.
CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/guile/guile-core/doc/ChangeLog.diff?cvsroot=OldCVS&tr1=1.88&tr2=1.89&r1=text&r2=text
http://savannah.gnu.org/cgi-bin/viewcvs/guile/guile-core/doc/expect.texi.diff?cvsroot=OldCVS&tr1=1.1&tr2=1.2&r1=text&r2=text
http://savannah.gnu.org/cgi-bin/viewcvs/guile/guile-core/doc/intro.texi.diff?cvsroot=OldCVS&tr1=1.8&tr2=1.9&r1=text&r2=text
http://savannah.gnu.org/cgi-bin/viewcvs/guile/guile-core/doc/posix.texi.diff?cvsroot=OldCVS&tr1=1.7&tr2=1.8&r1=text&r2=text
http://savannah.gnu.org/cgi-bin/viewcvs/guile/guile-core/doc/repl-modules.texi.diff?cvsroot=OldCVS&tr1=1.1&tr2=1.2&r1=text&r2=text
http://savannah.gnu.org/cgi-bin/viewcvs/guile/guile-core/doc/scheme-binding.texi.diff?cvsroot=OldCVS&tr1=1.4&tr2=1.5&r1=text&r2=text
http://savannah.gnu.org/cgi-bin/viewcvs/guile/guile-core/doc/scheme-control.texi.diff?cvsroot=OldCVS&tr1=1.12&tr2=1.13&r1=text&r2=text
http://savannah.gnu.org/cgi-bin/viewcvs/guile/guile-core/doc/scheme-data.texi.diff?cvsroot=OldCVS&tr1=1.17&tr2=1.18&r1=text&r2=text
http://savannah.gnu.org/cgi-bin/viewcvs/guile/guile-core/doc/scheme-procedures.texi.diff?cvsroot=OldCVS&tr1=1.11&tr2=1.12&r1=text&r2=text
http://savannah.gnu.org/cgi-bin/viewcvs/guile/guile-core/doc/scheme-utility.texi.diff?cvsroot=OldCVS&tr1=1.6&tr2=1.7&r1=text&r2=text
http://savannah.gnu.org/cgi-bin/viewcvs/guile/guile-core/doc/scripts.texi.diff?cvsroot=OldCVS&tr1=1.1&tr2=1.2&r1=text&r2=text
http://savannah.gnu.org/cgi-bin/viewcvs/guile/guile-core/doc/srfi-modules.texi.diff?cvsroot=OldCVS&tr1=1.2&tr2=1.3&r1=text&r2=text
Patches:
Index: guile/guile-core/doc/ChangeLog
diff -u guile/guile-core/doc/ChangeLog:1.88 guile/guile-core/doc/ChangeLog:1.89
--- guile/guile-core/doc/ChangeLog:1.88 Mon May 14 14:37:51 2001
+++ guile/guile-core/doc/ChangeLog Wed May 16 11:08:12 2001
@@ -1,3 +1,17 @@
+2001-05-15 Martin Grabmueller <address@hidden>
+
+ * scripts.texi (Invoking Guile): Added docs for --use-srfi.
+
+ * expect.texi, repl-modules.texi: Start the chapters with a new
+ page.
+
+ * srfi-modules.texi (SRFI-0): Added note about supported feature
+ identifiers and an example. Start the chapter with a new page.
+
+ * srfi-modules.texi, scheme-data.texi, scheme-control.texi,
+ scheme-binding.texi, repl-modules.texi, posix.texi, intro.texi,
+ scheme-utility.texi: Change `--' to `-' throughout.
+
2001-05-14 Martin Grabmueller <address@hidden>
* srfi-13-14.texi: Removed.
Index: guile/guile-core/doc/expect.texi
diff -u guile/guile-core/doc/expect.texi:1.1
guile/guile-core/doc/expect.texi:1.2
--- guile/guile-core/doc/expect.texi:1.1 Fri Mar 9 00:21:59 2001
+++ guile/guile-core/doc/expect.texi Wed May 16 11:08:12 2001
@@ -1,3 +1,4 @@
address@hidden
@node Expect
@chapter Expect
Index: guile/guile-core/doc/intro.texi
diff -u guile/guile-core/doc/intro.texi:1.8 guile/guile-core/doc/intro.texi:1.9
--- guile/guile-core/doc/intro.texi:1.8 Sun May 13 12:14:41 2001
+++ guile/guile-core/doc/intro.texi Wed May 16 11:08:12 2001
@@ -1,4 +1,4 @@
address@hidden $Id: intro.texi,v 1.8 2001/05/13 19:14:41 ttn Exp $
address@hidden $Id: intro.texi,v 1.9 2001/05/16 18:08:12 mgrabmue Exp $
@page
@node What is Guile?
@@ -869,7 +869,7 @@
@item
When some part of the documentation is not clear and does not make sense
-to you even after re--reading the section, it is a bug.
+to you even after re-reading the section, it is a bug.
@end itemize
When you write a bug report, please make sure to include as much of the
@@ -915,7 +915,7 @@
us, you are sending us on a wild goose chase.)
Be precise about these changes. A description in English is not
-enough--send a context diff for them.
+enough---send a context diff for them.
Adding files of your own, or porting to another machine, is a
modification of the source.
@@ -979,7 +979,7 @@
@item
Additional information from a C debugger such as GDB might enable
someone to find a problem on a machine which he does not have available.
-If you don't know how to use GDB, please read the GDB manual--it is not
+If you don't know how to use GDB, please read the GDB manual---it is not
very long, and using GDB is easy. You can find the GDB distribution,
including the GDB manual in online form, in most of the same places you
can find the Guile distribution. To run Guile under GDB, you should
Index: guile/guile-core/doc/posix.texi
diff -u guile/guile-core/doc/posix.texi:1.7 guile/guile-core/doc/posix.texi:1.8
--- guile/guile-core/doc/posix.texi:1.7 Fri May 4 14:53:59 2001
+++ guile/guile-core/doc/posix.texi Wed May 16 11:08:12 2001
@@ -2278,7 +2278,7 @@
@section Encryption
Please note that the procedures in this section are not suited for
-strong encryption, they are only interfaces to the well--known and
+strong encryption, they are only interfaces to the well-known and
common system library functions of the same name. They are just as good
(or bad) as the underlying functions, so you should refer to your system
documentation before using them.
Index: guile/guile-core/doc/repl-modules.texi
diff -u guile/guile-core/doc/repl-modules.texi:1.1
guile/guile-core/doc/repl-modules.texi:1.2
--- guile/guile-core/doc/repl-modules.texi:1.1 Wed May 2 14:50:15 2001
+++ guile/guile-core/doc/repl-modules.texi Wed May 16 11:08:12 2001
@@ -1,3 +1,4 @@
address@hidden
@node Readline Support
@chapter Readline Support
@@ -6,7 +7,7 @@
@cindex readline
@cindex command line history
Guile comes with an interface module to the readline library. This
-makes interactive use much more convenient, because of the command--line
+makes interactive use much more convenient, because of the command-line
editing features of readline. Using @code{(ice-9 readline)}, you can
navigate through the current input line with the cursor keys, retrieve
older command lines from the input history and even search through the
@@ -43,10 +44,11 @@
When you quit your Guile session by evaluating @code{(quit)} or pressing
Ctrl-D, the history will be saved to the file @file{.guile_history} and
read in when you start Guile for the next time. Thus you can start a
-new Guile session and still have the (probably long--winded) definition
+new Guile session and still have the (probably long-winded) definition
expressions available.
address@hidden
@node Value History
@chapter Value History
Index: guile/guile-core/doc/scheme-binding.texi
diff -u guile/guile-core/doc/scheme-binding.texi:1.4
guile/guile-core/doc/scheme-binding.texi:1.5
--- guile/guile-core/doc/scheme-binding.texi:1.4 Fri Apr 20 07:43:30 2001
+++ guile/guile-core/doc/scheme-binding.texi Wed May 16 11:08:12 2001
@@ -62,7 +62,7 @@
As opposed to definitions at the top level, which are visible in the
whole program (or current module, when Guile modules are used), it is
also possible to define variables which are only visible in a
-well--defined part of the program. Normally, this part of a program
+well-defined part of the program. Normally, this part of a program
will be a procedure or a subexpression of a procedure.
With the constructs for local binding (@code{let}, @code{let*} and
@@ -83,7 +83,7 @@
((@var{variable1} @var{init1}) @dots{})
@end lisp
-that is zero or more two--element lists of a variable and an arbitrary
+that is zero or more two-element lists of a variable and an arbitrary
expression each. All @var{variable} names must be distinct.
A @code{let} expression is evaluated as follows.
@@ -179,9 +179,9 @@
@end lisp
Here the enclosing form is a @code{let}, so the @code{define}s in the
address@hidden are internal definitions. Because the scope of the
address@hidden are internal definitions. Because the scope of the
internal definitions is the @strong{complete} body of the
address@hidden, the @code{lambda}--expression which gets bound
address@hidden, the @code{lambda}-expression which gets bound
to the variable @code{banana} may refer to the variable @code{apple},
even thogh it's definition appears lexically @emph{after} the definition
of @code{banana}. This is because a sequence of internal definition
Index: guile/guile-core/doc/scheme-control.texi
diff -u guile/guile-core/doc/scheme-control.texi:1.12
guile/guile-core/doc/scheme-control.texi:1.13
--- guile/guile-core/doc/scheme-control.texi:1.12 Fri May 4 14:53:59 2001
+++ guile/guile-core/doc/scheme-control.texi Wed May 16 11:08:12 2001
@@ -39,13 +39,13 @@
@end lisp
If the two calls to @code{display} and @code{newline} were not embedded
-in a @code{begin}--statement, the call to @code{newline} would get
-misinterpreted as the else--branch of the @code{if}--expression.
+in a @code{begin}-statement, the call to @code{newline} would get
+misinterpreted as the else-branch of the @code{if}-expression.
@deffn syntax begin expr1 expr2 @dots{}
-The expression(s) are evaluated in left--to--right order and the value
+The expression(s) are evaluated in left-to-right order and the value
of the last expression is returned as the value of the
address@hidden This expression type is used when the
address@hidden This expression type is used when the
expressions before the last one are evaluated for their side effects.
@end deffn
@@ -62,7 +62,7 @@
@cindex cond
Guile provides three syntactic constructs for conditional evaluation.
address@hidden is the normal if--then--else expression (with an optional else
address@hidden is the normal if-then-else expression (with an optional else
branch), @code{cond} is a conditional expression with multiple branches
and @code{case} branches if an expression has one of a set of constant
values.
@@ -98,13 +98,13 @@
The @var{test}s of the clauses are evaluated in order and as soon as one
of them evaluates to a true values, the corresponding @var{expression}s
are evaluated in order and the last value is returned as the value of
-the @code{cond}--expression. For the @code{=>} clause type,
+the @code{cond}-expression. For the @code{=>} clause type,
@var{expression} is evaluated and the resulting procedure is applied to
the value of @var{test}. The result of this procedure application is
-then the result of the @code{cond}--expression.
+then the result of the @code{cond}-expression.
The @var{test} of the last @var{clause} may be the keyword @code{else}.
-Then, if none of the preceding @var{test}s is true, the @var{expression}s
following the @code{else} are evaluated to produce the result of the
@code{cond}--expression.
+Then, if none of the preceding @var{test}s is true, the @var{expression}s
following the @code{else} are evaluated to produce the result of the
@code{cond}-expression.
@end deffn
@deffn syntax case key clause1 clause2 @dots{}
@@ -127,7 +127,7 @@
the last expression as the result of the @code{case} expression.
If the @var{key} matches no @var{datum} and there is an
address@hidden, the expressions following the @code{else} are
address@hidden, the expressions following the @code{else} are
evaluated. If there is no such clause, the result of the expression is
unspecified.
@end deffn
@@ -204,11 +204,11 @@
@cindex named let
Another very common way of expressing iteration in Scheme programs is
-the use of the so--called @dfn{named let}.
+the use of the so-called @dfn{named let}.
Named let is a variant of @code{let} which creates a procedure and calls
it in one step. Because of the newly created procedure, named let is
-more powerful than @code{do}---it can be used for iteration, but also
+more powerful than @code{do}--it can be used for iteration, but also
for arbitrary recursion.
@deffn syntax let variable bindings body
@@ -310,7 +310,7 @@
Scheme allows a procedure to return more than one value to its caller.
This is quite different to other languages which only allow
-single--value returns. Returning multiple values is different from
+single-value returns. Returning multiple values is different from
returning a list (or pair or vector) of values to the caller, because
conceptionally not @emph{one} compound object is returned, but several
distinct values.
Index: guile/guile-core/doc/scheme-data.texi
diff -u guile/guile-core/doc/scheme-data.texi:1.17
guile/guile-core/doc/scheme-data.texi:1.18
--- guile/guile-core/doc/scheme-data.texi:1.17 Sat May 5 06:40:18 2001
+++ guile/guile-core/doc/scheme-data.texi Wed May 16 11:08:12 2001
@@ -1337,7 +1337,7 @@
@node Strings
@section Strings
-Strings are fixed--length sequences of characters. They can be created
+Strings are fixed-length sequences of characters. They can be created
by calling constructor procedures, but they can also literally get
entered at the REPL or in Scheme source files.
@@ -1345,11 +1345,11 @@
handling is very important when Guile is used as a scripting language.
Strings always carry the information about how many characters they are
-composed of with them, so there is no special end--of--string character,
+composed of with them, so there is no special end-of-string character,
like in C. That means that Scheme strings can contain any character,
even the NUL character @code{'\0'}. But note: Since most operating
system calls dealing with strings (such as for file operations) expect
-strings to be zero--terminated, they might do unexpected things when
+strings to be zero-terminated, they might do unexpected things when
called with string containing unusal characters.
@menu
@@ -1507,7 +1507,7 @@
@node String Modification
@subsection String Modification
-These procedures are for modifying strings in--place. That means, that
+These procedures are for modifying strings in-place. That means, that
not a new string is the result of a string operation, but that the
actual memory representation of a string is modified.
@@ -1738,7 +1738,7 @@
@node Alphabetic Case Mapping
@subsection Alphabetic Case Mapping
-These are procedures for mapping strings to their upper-- or lower--case
+These are procedures for mapping strings to their upper- or lower-case
equivalents, respectively, or for capitalizing strings.
@deffn primitive string-upcase str
@@ -1810,7 +1810,7 @@
@deffn primitive string-ci->symbol str
Return the symbol whose name is @var{str}. @var{str} is
converted to lowercase before the conversion is done, if Guile
-is currently reading symbols case--insensitively.
+is currently reading symbols case-insensitively.
@end deffn
@@ -2292,13 +2292,13 @@
The association between symbols and values is maintained in special data
structures, the symbol tables.
-In addition, Guile offers variables as first--class objects. They can
+In addition, Guile offers variables as first-class objects. They can
be used for interacting with the module system.
@menu
* Symbols:: All about symbols as a data type.
* Symbol Tables:: Tables for mapping symbols to values.
-* Variables:: First--class variables.
+* Variables:: First-class variables.
@end menu
@node Symbols
@@ -2398,7 +2398,7 @@
Report on Scheme}) or by a call to the @code{read} procedure,
and its name contains alphabetic characters, then the string
returned will contain characters in the implementation's
-preferred standard case---some implementations will prefer
+preferred standard case--some implementations will prefer
upper case, others lower case. If the symbol was returned by
@code{string->symbol}, the case of characters in the string
returned will be the same as the case in the string that was
@@ -2535,7 +2535,7 @@
one of the constructor procedures @code{make-variable} or
@code{make-undefined-variable} or retrieved by @code{builtin-variable}.
-First--class variables are especially useful for interacting with the
+First-class variables are especially useful for interacting with the
current module system (REFFIXME).
@deffn primitive builtin-variable name
@@ -2976,7 +2976,7 @@
@c FIXME::martin: Review me!
Often it is useful to test whether a given Scheme object is a list or
-not. List--processing procedures could use this information to test
+not. List-processing procedures could use this information to test
whether their input is valid, or they could do different things
depending on the datatype of their arguments.
@@ -2985,7 +2985,7 @@
Return @code{#t} iff @var{x} is a proper list, else @code{#f}.
@end deffn
-The predicate @code{null?} is often used in list--processing code to
+The predicate @code{null?} is often used in list-processing code to
tell whether a given list has run out of elements. That is, a loop
somehow deals with the elements of a list until the list satisfies
@code{null?}. Then, teh algorithm terminates.
@@ -3079,7 +3079,7 @@
return lists with the same elements as their arguments, but in reverse
order. The procedure variants with an @code{!} directly modify the
pairs which form the list, whereas the other procedures create new
-pairs. This is why you should be careful when using the side--effecting
+pairs. This is why you should be careful when using the side-effecting
variants.
@rnindex append
@@ -4978,7 +4978,7 @@
@subsection Hook Examples
Hook usage is shown by some examples in this section. First, we will
-define a hook of arity 2---that is, the procedures stored in the hook
+define a hook of arity 2 --- that is, the procedures stored in the hook
will have to accept two arguments.
@lisp
Index: guile/guile-core/doc/scheme-procedures.texi
diff -u guile/guile-core/doc/scheme-procedures.texi:1.11
guile/guile-core/doc/scheme-procedures.texi:1.12
--- guile/guile-core/doc/scheme-procedures.texi:1.11 Sun May 13 12:14:41 2001
+++ guile/guile-core/doc/scheme-procedures.texi Wed May 16 11:08:12 2001
@@ -65,7 +65,7 @@
called, the sequence of actual arguments will converted into a list and
stored into the newly created location for the formal variable.
@item (@var{variable1} @dots{} @var{variablen} . @var{variablen+1})
-If a space--delimited period precedes the last variable, then the
+If a space-delimited period precedes the last variable, then the
procedure takes @var{n} or more variablesm where @var{n} is the number
of formal arguments before the period. There must be at least one
argument before the period. The first @var{n} actual arguments will be
@@ -432,7 +432,7 @@
A @dfn{procedure with setter} is a special kind of procedure which
normally behaves like any accesor procedure, that is a procedure which
accesses a data structure. The difference is that this kind of
-procedure has a so--called @dfn{setter} attached, which is a procedure
+procedure has a so-called @dfn{setter} attached, which is a procedure
for storing something into a data structure.
Procedures with setters are treated specially when the procedure appears
Index: guile/guile-core/doc/scheme-utility.texi
diff -u guile/guile-core/doc/scheme-utility.texi:1.6
guile/guile-core/doc/scheme-utility.texi:1.7
--- guile/guile-core/doc/scheme-utility.texi:1.6 Tue Apr 17 08:34:33 2001
+++ guile/guile-core/doc/scheme-utility.texi Wed May 16 11:08:12 2001
@@ -153,8 +153,8 @@
@cindex sorting vectors
Sorting is very important in computer programs. Therefore, Guile comes
-with several sorting procedures built--in. As always, procedures with
-names ending in @code{!} are side--effecting, that means that they may
+with several sorting procedures built-in. As always, procedures with
+names ending in @code{!} are side-effecting, that means that they may
modify their parameters in order to produce their results.
The first group of procedures can be used to merge two lists (which must
@@ -271,7 +271,7 @@
@c FIXME::martin: Review me!
-When debugging Scheme programs, but also for providing a human--friendly
+When debugging Scheme programs, but also for providing a human-friendly
interface, a procedure for converting any Scheme object into string
format is very useful. Conversion from/to strings can of course be done
with specialized procedures when the data type of the object to convert
Index: guile/guile-core/doc/scripts.texi
diff -u guile/guile-core/doc/scripts.texi:1.1
guile/guile-core/doc/scripts.texi:1.2
--- guile/guile-core/doc/scripts.texi:1.1 Fri Mar 9 00:22:00 2001
+++ guile/guile-core/doc/scripts.texi Wed May 16 11:08:12 2001
@@ -83,6 +83,17 @@
This switch is still experimental.
address@hidden address@hidden
+The option @code{--use-srfi} expects a comma-separated list of numbers,
+each representing a SRFI number to be loaded into the interpreter
+before starting evaluating a script file or the REPL. Additionally,
+the feature identifier for the loaded SRFIs is recognized by
+`cond-expand' when using this option.
+
address@hidden
+guile --use-srfi=8,13
address@hidden example
+
@item address@hidden, }--help
Display help on invoking Guile, and then exit.
Index: guile/guile-core/doc/srfi-modules.texi
diff -u guile/guile-core/doc/srfi-modules.texi:1.2
guile/guile-core/doc/srfi-modules.texi:1.3
--- guile/guile-core/doc/srfi-modules.texi:1.2 Mon May 14 14:37:51 2001
+++ guile/guile-core/doc/srfi-modules.texi Wed May 16 11:08:12 2001
@@ -1,3 +1,4 @@
address@hidden
@node SRFI Support
@chapter Various SRFI Support Modules
@@ -5,11 +6,10 @@
documents define a lot of syntactic and procedure extensions to standard
Scheme as defined in R5RS.
-In addition to the string and character-set libraries---documented in
-the next chapter---Guile has support for a number of SRFIs. This
-chapter gives an overview over the available SRFIs and some usage hints.
-For complete documentation, design rationales and further examples, we
-advise you to get the relevant SRFI documents from the SRFI home page
+Guile has support for a number of SRFIs. This chapter gives an overview
+over the available SRFIs and some usage hints. For complete
+documentation, design rationales and further examples, we advise you to
+get the relevant SRFI documents from the SRFI home page
@url{http://srfi.schemers.org}.
@menu
@@ -84,7 +84,23 @@
Guile. Thus, it is not necessary to use any module to get access to
this form.
+Currently, the feature identifiers @code{guile}, @code{r5rs} and
address@hidden are supported. The other SRFIs are not in that list,
+because the SRFI modules must be explicitly used before their exported
+bindings can be used. So if a Scheme program wishes to detect whether
+SRFI-8 is supported in the running implementation, code similar to this
+may be needed:
address@hidden
+(cond-expand
+ (guile
+ (use-modules (srfi srfi-8)))
+ (srfi-8
+ #t))
+ ;; otherwise fail.
address@hidden lisp
+
+
@node SRFI-2
@section SRFI-2 - and-let*
@@ -1160,7 +1176,7 @@
Character sets can be manipulated with the common set algebra operation,
such as union, complement, intersection etc. All of these procedures
-provide side--effecting variants, which modify their character set
+provide side-effecting variants, which modify their character set
argument(s).
@deffn primitive char-set-adjoin cs char1 @dots{}
@@ -1197,7 +1213,7 @@
@deffn primitive char-set-xor cs1 @dots{}
@deffnx primitive char-set-xor! cs1 @dots{}
-Return the exclusive--or of all argument character sets.
+Return the exclusive-or of all argument character sets.
@end deffn
@deffn primitive char-set-diff+intersection cs1 @dots{}
@@ -1216,11 +1232,11 @@
useful, several predefined character set variables exist.
@defvar char-set:lower-case
-All lower--case characters.
+All lower-case characters.
@end defvar
@defvar char-set:upper-case
-All upper--case characters.
+All upper-case characters.
@end defvar
@defvar char-set:title-case
| [Prev in Thread] |
Current Thread |
[Next in Thread] |
- guile/guile-core/doc ChangeLog expect.texi intr...,
Martin Grabmueller <=