/[guile]/guile/guile-core/doc/ref/srfi-modules.texi
ViewVC logotype

Diff of /guile/guile-core/doc/ref/srfi-modules.texi

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1.1.2.4 by ttn, Tue Nov 6 22:45:16 2001 UTC revision 1.1.2.5 by ttn, Tue Jan 8 09:22:37 2002 UTC
# Line 122  If no clause is satisfied, an error is s Line 122  If no clause is satisfied, an error is s
122    
123  Since @code{cond-expand} is needed to tell what a Scheme implementation  Since @code{cond-expand} is needed to tell what a Scheme implementation
124  provides, it must be accessible without using any  provides, it must be accessible without using any
125  implementation-dependant operations, such as @code{use-modules} in  implementation-dependent operations, such as @code{use-modules} in
126  Guile.  Thus, it is not necessary to use any module to get access to  Guile.  Thus, it is not necessary to use any module to get access to
127  this form.  this form.
128    
# Line 185  processing procedure, you should also ha Line 185  processing procedure, you should also ha
185  * SRFI-1 Length Append etc::    Length calculation and list appending.  * SRFI-1 Length Append etc::    Length calculation and list appending.
186  * SRFI-1 Fold and Map::         Higher-order list processing.  * SRFI-1 Fold and Map::         Higher-order list processing.
187  * SRFI-1 Filtering and Partitioning::  Filter lists based on predicates.  * SRFI-1 Filtering and Partitioning::  Filter lists based on predicates.
188  * SRFI-1 Searching::            Search for elments.  * SRFI-1 Searching::            Search for elements.
189  * SRFI-1 Deleting::             Delete elements from lists.  * SRFI-1 Deleting::             Delete elements from lists.
190  * SRFI-1 Association Lists::    Handle association lists.  * SRFI-1 Association Lists::    Handle association lists.
191  * SRFI-1 Set Operations::       Use lists for representing sets.  * SRFI-1 Set Operations::       Use lists for representing sets.
# Line 252  the empty list, but some other value. Line 252  the empty list, but some other value.
252  @deffn procedure null-list? lst  @deffn procedure null-list? lst
253  Return @code{#t} if @var{lst} is the empty list @code{()}, @code{#f}  Return @code{#t} if @var{lst} is the empty list @code{()}, @code{#f}
254  otherwise.  If something else than a proper or circular list is passed  otherwise.  If something else than a proper or circular list is passed
255  as @var{lst}, an error is signalled.  This procedure is recommented  as @var{lst}, an error is signalled.  This procedure is recommended
256  for checking for the end of a list in contexts where dotted lists are  for checking for the end of a list in contexts where dotted lists are
257  not allowed.  not allowed.
258  @end deffn  @end deffn
# Line 502  the list(s) @var{lst1}, @var{lst2}, @dot Line 502  the list(s) @var{lst1}, @var{lst2}, @dot
502  specified.  This procedure is extended with respect to R5RS, because  specified.  This procedure is extended with respect to R5RS, because
503  the argument lists may have different lengths.  The shortest argument  the argument lists may have different lengths.  The shortest argument
504  list determines the number of times @var{f} is called.  @var{f} will  list determines the number of times @var{f} is called.  @var{f} will
505  be applied to tge list elements in left-to-right order.  be applied to the list elements in left-to-right order.
506    
507  @end deffn  @end deffn
508    
# Line 646  result. Line 646  result.
646  Apply @var{pred} across the lists and return a true value if the  Apply @var{pred} across the lists and return a true value if the
647  predicate returns true for any of the list elements(s); return  predicate returns true for any of the list elements(s); return
648  @code{#f} otherwise.  The true value returned is always the result of  @code{#f} otherwise.  The true value returned is always the result of
649  the first succesful application of @var{pred}.  the first successful application of @var{pred}.
650  @end deffn  @end deffn
651    
652  @deffn procedure every pred lst1 lst2 @dots{}  @deffn procedure every pred lst1 lst2 @dots{}
653  Apply @var{pred} across the lists and return a true value if the  Apply @var{pred} across the lists and return a true value if the
654  predicate returns true for every of the list elements(s); return  predicate returns true for every of the list elements(s); return
655  @code{#f} otherwise.  The true value returned is always the result of  @code{#f} otherwise.  The true value returned is always the result of
656  the final succesful application of @var{pred}.  the final successful application of @var{pred}.
657  @end deffn  @end deffn
658    
659  @deffn procedure list-index pred lst1 lst2 @dots{}  @deffn procedure list-index pred lst1 lst2 @dots{}
# Line 748  structure of the list @var{alist} in ord Line 748  structure of the list @var{alist} in ord
748    
749  Lists can be used for representing sets of objects.  The procedures  Lists can be used for representing sets of objects.  The procedures
750  documented in this section can be used for such set representations.  documented in this section can be used for such set representations.
751  Man combinding several sets or adding elements, they make sure that no  Man combining several sets or adding elements, they make sure that no
752  object is contained more than once in a given list.  Please note that  object is contained more than once in a given list.  Please note that
753  lists are not a too efficient implementation method for sets, so if  lists are not a too efficient implementation method for sets, so if
754  you need high performance, you should think about implementing a  you need high performance, you should think about implementing a
# Line 1064  read syntax form Line 1064  read syntax form
1064  @end example  @end example
1065    
1066  where @var{ctor} must be a symbol for which a read constructor was  where @var{ctor} must be a symbol for which a read constructor was
1067  defined previouly, using @code{define-reader-ctor}.  defined previously, using @code{define-reader-ctor}.
1068    
1069  Example:  Example:
1070    
# Line 1146  soon as possible. Line 1146  soon as possible.
1146  * SRFI-13 Constructors::        String constructing procedures.  * SRFI-13 Constructors::        String constructing procedures.
1147  * SRFI-13 List/String Conversion::  Conversion from/to lists.  * SRFI-13 List/String Conversion::  Conversion from/to lists.
1148  * SRFI-13 Selection::           Selection portions of strings.  * SRFI-13 Selection::           Selection portions of strings.
1149  * SRFI-13 Modification::        Modfify strings in-place.  * SRFI-13 Modification::        Modify strings in-place.
1150  * SRFI-13 Comparison::          Compare strings.  * SRFI-13 Comparison::          Compare strings.
1151  * SRFI-13 Prefixes/Suffixes::   Detect common pre-/suffixes.  * SRFI-13 Prefixes/Suffixes::   Detect common pre-/suffixes.
1152  * SRFI-13 Searching::           Searching for substrings.  * SRFI-13 Searching::           Searching for substrings.
# Line 1465  character or a given substring, or a cha Line 1465  character or a given substring, or a cha
1465  @deffn primitive string-index s char_pred [start end]  @deffn primitive string-index s char_pred [start end]
1466  @deffnx primitive string-index-right s char_pred [start end]  @deffnx primitive string-index-right s char_pred [start end]
1467  Search through the string @var{s} from left to right (right to left),  Search through the string @var{s} from left to right (right to left),
1468  returning the index of the first (last) occurence of a character which  returning the index of the first (last) occurrence of a character which
1469    
1470  @itemize @bullet  @itemize @bullet
1471  @item  @item
1472  equals @var{char_pred}, if it is character,  equals @var{char_pred}, if it is character,
1473    
1474  @item  @item
1475  satisifies the predicate @var{char_pred}, if it is a  satisfies the predicate @var{char_pred}, if it is a
1476  procedure,  procedure,
1477    
1478  @item  @item
# Line 1483  is in the set @var{char_pred}, if it is Line 1483  is in the set @var{char_pred}, if it is
1483  @deffn primitive string-skip s char_pred [start end]  @deffn primitive string-skip s char_pred [start end]
1484  @deffnx primitive string-skip-right s char_pred [start end]  @deffnx primitive string-skip-right s char_pred [start end]
1485  Search through the string @var{s} from left to right (right to left),  Search through the string @var{s} from left to right (right to left),
1486  returning the index of the first (last) occurence of a character which  returning the index of the first (last) occurrence of a character which
1487    
1488  @itemize @bullet  @itemize @bullet
1489  @item  @item
1490  does not equal @var{char_pred}, if it is character,  does not equal @var{char_pred}, if it is character,
1491    
1492  @item  @item
1493  does not satisify the predicate @var{char_pred}, if it is  does not satisfy the predicate @var{char_pred}, if it is
1494  a procedure.  a procedure.
1495    
1496  @item  @item
# Line 1507  Return the count of the number of charac Line 1507  Return the count of the number of charac
1507  equals @var{char_pred}, if it is character,  equals @var{char_pred}, if it is character,
1508    
1509  @item  @item
1510  satisifies the predicate @var{char_pred}, if it is a procedure.  satisfies the predicate @var{char_pred}, if it is a procedure.
1511    
1512  @item  @item
1513  is in the set @var{char_pred}, if it is a character set.  is in the set @var{char_pred}, if it is a character set.
# Line 1772  the module @code{(srfi srfi-14)}, as wel Line 1772  the module @code{(srfi srfi-14)}, as wel
1772  * SRFI-14 Character Set Data Type::  Underlying data type for charsets.  * SRFI-14 Character Set Data Type::  Underlying data type for charsets.
1773  * SRFI-14 Predicates/Comparison::  Charset predicates.  * SRFI-14 Predicates/Comparison::  Charset predicates.
1774  * SRFI-14 Iterating Over Character Sets::  Enumerate charset elements.  * SRFI-14 Iterating Over Character Sets::  Enumerate charset elements.
1775  * SRFI-14 Creating Character Sets::  Makeing new charsets.  * SRFI-14 Creating Character Sets::  Making new charsets.
1776  * SRFI-14 Querying Character Sets::  Test charsets for membership etc.  * SRFI-14 Querying Character Sets::  Test charsets for membership etc.
1777  * SRFI-14 Character-Set Algebra::  Calculating new charsets.  * SRFI-14 Character-Set Algebra::  Calculating new charsets.
1778  * SRFI-14 Standard Character Sets::  Variables containing predefined charsets.  * SRFI-14 Standard Character Sets::  Variables containing predefined charsets.
# Line 1965  character codes lie in the half-open ran Line 1965  character codes lie in the half-open ran
1965  If @var{error} is a true value, an error is signalled if the  If @var{error} is a true value, an error is signalled if the
1966  specified range contains characters which are not contained in  specified range contains characters which are not contained in
1967  the implemented character range.  If @var{error} is @code{#f},  the implemented character range.  If @var{error} is @code{#f},
1968  these characters are silently left out of the resultung  these characters are silently left out of the resulting
1969  character set.  character set.
1970    
1971  The characters in @var{base_cs} are added to the result, if  The characters in @var{base_cs} are added to the result, if

Legend:
Removed from v.1.1.2.4  
changed lines
  Added in v.1.1.2.5

savannah-hackers-public@gnu.org
ViewVC Help
Powered by ViewVC 1.1.26