srfi-41
SRFI 41 for Chicken Scheme.
TOC »
- srfi-41
- Documentation
- Primitive
- Derived
- Usage
- define-stream
- stream-of
- stream-let
- stream-match
- stream
- list->stream
- port->stream
- stream->list
- stream-append
- stream-concat
- stream-drop
- stream-drop-while
- stream-filter
- stream-fold
- stream-for-each
- stream-map
- stream-from
- stream-iterate
- stream-length
- stream-range
- stream-ref
- stream-reverse
- stream-scan
- stream-unfold
- stream-unfolds
- stream-zip
- Utilities
- Usage
- stream-intersperse
- stream-permutations
- file->stream
- stream-split
- stream-unique
- stream-fold-one
- stream-member
- stream-merge
- stream-partition
- stream-finds
- stream-find
- stream-remove
- stream-every
- stream-any
- stream-and
- stream-or
- stream-fold-right
- stream-fold-right-one
- stream-assoc
- stream-equal?
- stream-quick-sort
- stream-insertion-sort
- stream-merge-sort
- stream-maximum
- stream-minimum
- binary-tree-same-fringe?
- Math Utilities
- Examples
- Requirements
- Author
- Version history
- License
Documentation
See the SRFI-41 Document.
Primitive
Usage
(require-extension streams-primitive)
stream?
- (stream? OBJECT) => boolean procedure
stream-pair?
- (stream-pair? OBJECT) => boolean procedure
stream-null?
- (stream-null? OBJECT) => boolean procedure
stream-occupied?
- (stream-occupied? OBJECT) => boolean procedure
Inverse of stream-null?.
stream-null
- stream-null constant
The null stream value.
stream-cons
stream-lambda
stream-car
- (stream-car STREAM) => * procedure
stream-cdr
- (stream-cdr STREAM) => stream procedure
Derived
Usage
(require-extension streams-derived)
define-stream
stream-of
stream-let
stream-match
stream
- (stream OBJECT...) => stream syntax
list->stream
- (list->stream LIST) => stream procedure
port->stream
stream->list
- (stream->list [COUNT #f] STREAM) => list procedure
stream-append
- (stream-append STREAM...) => stream procedure
stream-concat
- (stream-concat STREAM) => stream procedure
Flatten a stream of streams.
stream-drop
- (stream-drop COUNT STREAM) => stream procedure
stream-drop-while
stream-filter
stream-fold
stream-for-each
stream-map
stream-from
- (stream-from FIRST [STEP 1]) => stream procedure
stream-iterate
- (stream-iterate FUNCTION BASE) => stream procedure
stream-length
- (stream-length STREAM) => FIXNUM procedure
stream-range
stream-ref
- (stream-ref STREAM INDEX) => * procedure
stream-reverse
- (stream-reverse STREAM) => stream procedure
stream-scan
stream-unfold
stream-unfolds
stream-zip
- (stream-zip STREAM...) => stream procedure
Utilities
Usage
(require-extension streams-utils)
stream-intersperse
stream-permutations
- (stream-permutations STREAM) => stream procedure
file->stream
stream-split
stream-unique
- (stream-unique =? STREAM) => stream procedure
stream-fold-one
stream-member
stream-merge
- (stream-merge <? STREAM ...) => stream procedure
stream-partition
stream-finds
stream-find
- (stream-find =? OBJECT STREAM) => stream procedure
stream-remove
stream-every
stream-any
- (stream-any PREDICATE STREAM) => boolean procedure
stream-and
- (stream-and STREAM) => boolean procedure
stream-or
- (stream-or STREAM) => boolean procedure
stream-fold-right
stream-fold-right-one
stream-assoc
stream-equal?
stream-quick-sort
- (stream-quick-sort <? STREAM) => stream procedure
stream-insertion-sort
stream-merge-sort
- (stream-merge-sort <? STREAM) => stream procedure
stream-maximum
- (stream-maximum <? STREAM) => * procedure
stream-minimum
- (stream-minimum <? STREAM) => * procedure
binary-tree-same-fringe?
- (binary-tree-same-fringe? TREE1 TREE2) => boolean procedure
TREE1 and TREE2 are binary-tree nodes, so either () or pair.
Lazy version of the same fringe.
Math Utilities
Usage
(require-extension streams-math)
stream-max
- (stream-max STREAM) => * procedure
stream-min
- (stream-min STREAM) => * procedure
stream-sum
- stream-sum constant
odd-numbers-stream
- odd-numbers-stream constant
even-numbers-stream
- even-numbers-stream constant
cardinal-numbers-stream
- cardinal-numbers-stream constant
natural-numbers-stream
- natural-numbers-stream constant
prime-numbers-stream
- prime-numbers-stream constant
hamming-sequence-stream
- hamming-sequence-stream constant
Examples
(use streams) (define (sigma function m n) (stream-fold + 0 (stream-map function (stream-range m (add1 n))))) (define (factorial n) (stream-ref (stream-scan * 1 (stream-from 1)) n))
Usage
The exports of streams-primitive and streams-derived are povided by:
(require-extension streams)
Or (a synonym)
(require-extension srfi-41)
Requirements
check-errors combinators record-variants
Author
Philip L. Bewig
Version history
- 1.2.2
- Check for stream type when forcing; reported by Jim Ursetto. Faster prime number stream; thanks to Matthias Bauer.
- 1.2.1
- 1.2.0
- Use of record-variants & combinators.
- 1.1.0
- Added "srfi-41" modules as synonynom of "streams".
- 1.0.2
- Bug fix for problem w/ use of 'obj' in "streams-utils" reported by Josh Griffith. Better error message for nary stream procedures.
- 1.0.1
- Updated test.
- 1.0.0
- Chicken 4 release.
License
Copyright (C) 2007 by Philip L. Bewig of Saint Louis, Missouri, USA. All rights reserved. Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Copyright (C) 2009 Kon Lovett. All rights reserved.
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the Software), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED ASIS, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.