OXIESEC PANEL
- Current Dir:
/
/
usr
/
share
/
guile
/
2.0
/
ice-9
Server IP: 139.59.38.164
Upload:
Create Dir:
Name
Size
Modified
Perms
📁
..
-
04/11/2020 07:13:11 AM
rwxr-xr-x
📄
and-let-star.scm
2.53 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
binary-ports.scm
1.88 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
boot-9.scm
150.08 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
buffered-input.scm
4.82 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
calling.scm
10.54 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
channel.scm
5.19 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
command-line.scm
18.22 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
common-list.scm
8.95 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
control.scm
3.94 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
curried-definitions.scm
1.79 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
debug.scm
1.09 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
deprecated.scm
31.24 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
documentation.scm
7.41 KB
07/17/2018 10:14:45 AM
rw-r--r--
📄
eval-string.scm
2.93 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
eval.scm
20.85 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
expect.scm
5.5 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
format.scm
74.5 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
ftw.scm
24.24 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
futures.scm
10.92 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
gap-buffer.scm
10.14 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
getopt-long.scm
16.49 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
hash-table.scm
1.77 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
hcons.scm
2.55 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
history.scm
2.29 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
i18n.scm
15.75 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
iconv.scm
3.65 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
lineio.scm
3.85 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
list.scm
1.29 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
local-eval.scm
9.71 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
ls.scm
3.2 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
mapping.scm
4.84 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
match.scm
2 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
match.upstream.scm
35.6 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
networking.scm
3.33 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
null.scm
1.13 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
occam-channel.scm
7.26 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
optargs.scm
15.75 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
poe.scm
3.3 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
poll.scm
6.02 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
popen.scm
5.67 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
posix.scm
2.73 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
pretty-print.scm
15.83 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
psyntax-pp.scm
161.01 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
psyntax.scm
143.59 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
q.scm
4.2 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
quasisyntax.scm
5.22 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
r4rs.scm
9.42 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
r5rs.scm
1.56 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
r6rs-libraries.scm
8.95 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
rdelim.scm
7.47 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
readline.scm
9.56 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
receive.scm
1.06 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
regex.scm
8.87 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
runq.scm
8.18 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
rw.scm
1.02 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
safe-r5rs.scm
3.72 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
safe.scm
1.25 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
save-stack.scm
2.15 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
scm-style-repl.scm
11.71 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
serialize.scm
3.77 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
session.scm
17.72 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
slib.scm
1.55 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
stack-catch.scm
1.94 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
streams.scm
7.31 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
string-fun.scm
8.59 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
syncase.scm
1.52 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
threads.scm
6.24 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
time.scm
2.04 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
top-repl.scm
2.75 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
unicode.scm
1005 bytes
10/22/2016 08:09:34 PM
rw-r--r--
📄
vlist.scm
21.56 KB
10/22/2016 08:09:34 PM
rw-r--r--
📄
weak-vector.scm
1.26 KB
10/22/2016 08:09:34 PM
rw-r--r--
Editing: q.scm
Close
;;;; q.scm --- Queues ;;;; ;;;; Copyright (C) 1995, 2001, 2004, 2006 Free Software Foundation, Inc. ;;;; ;;;; This library is free software; you can redistribute it and/or ;;;; modify it under the terms of the GNU Lesser General Public ;;;; License as published by the Free Software Foundation; either ;;;; version 3 of the License, or (at your option) any later version. ;;;; ;;;; This library 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 Public License for more details. ;;;; ;;;; You should have received a copy of the GNU Lesser General Public ;;;; License along with this library; if not, write to the Free Software ;;;; Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA ;;;; ;;; Commentary: ;;; Q: Based on the interface to ;;; ;;; "queue.scm" Queues/Stacks for Scheme ;;; Written by Andrew Wilcox (awilcox@astro.psu.edu) on April 1, 1992. ;;; {Q} ;;; ;;; A list is just a bunch of cons pairs that follows some constrains, ;;; right? Association lists are the same. Hash tables are just ;;; vectors and association lists. You can print them, read them, ;;; write them as constants, pun them off as other data structures ;;; etc. This is good. This is lisp. These structures are fast and ;;; compact and easy to manipulate arbitrarily because of their ;;; simple, regular structure and non-disjointedness (associations ;;; being lists and so forth). ;;; ;;; So I figured, queues should be the same -- just a "subtype" of cons-pair ;;; structures in general. ;;; ;;; A queue is a cons pair: ;;; ( <the-q> . <last-pair> ) ;;; ;;; <the-q> is a list of things in the q. New elements go at the end ;;; of that list. ;;; ;;; <last-pair> is #f if the q is empty, and otherwise is the last ;;; pair of <the-q>. ;;; ;;; q's print nicely, but alas, they do not read well because the ;;; eq?-ness of <last-pair> and (last-pair <the-q>) is lost by read. ;;; ;;; All the functions that aren't explicitly defined to return ;;; something else (a queue element; a boolean value) return the queue ;;; object itself. ;;; Code: (define-module (ice-9 q) :export (sync-q! make-q q? q-empty? q-empty-check q-front q-rear q-remove! q-push! enq! q-pop! deq! q-length)) ;;; sync-q! ;;; The procedure ;;; ;;; (sync-q! q) ;;; ;;; recomputes and resets the <last-pair> component of a queue. ;;; (define (sync-q! q) (set-cdr! q (if (pair? (car q)) (last-pair (car q)) #f)) q) ;;; make-q ;;; return a new q. ;;; (define (make-q) (cons '() #f)) ;;; q? obj ;;; Return true if obj is a Q. ;;; An object is a queue if it is equal? to '(() . #f) ;;; or it is a pair P with (list? (car P)) ;;; and (eq? (cdr P) (last-pair (car P))). ;;; (define (q? obj) (and (pair? obj) (if (pair? (car obj)) (eq? (cdr obj) (last-pair (car obj))) (and (null? (car obj)) (not (cdr obj)))))) ;;; q-empty? obj ;;; (define (q-empty? obj) (null? (car obj))) ;;; q-empty-check q ;;; Throw a q-empty exception if Q is empty. (define (q-empty-check q) (if (q-empty? q) (throw 'q-empty q))) ;;; q-front q ;;; Return the first element of Q. (define (q-front q) (q-empty-check q) (caar q)) ;;; q-rear q ;;; Return the last element of Q. (define (q-rear q) (q-empty-check q) (cadr q)) ;;; q-remove! q obj ;;; Remove all occurences of obj from Q. (define (q-remove! q obj) (set-car! q (delq! obj (car q))) (sync-q! q)) ;;; q-push! q obj ;;; Add obj to the front of Q (define (q-push! q obj) (let ((h (cons obj (car q)))) (set-car! q h) (or (cdr q) (set-cdr! q h))) q) ;;; enq! q obj ;;; Add obj to the rear of Q (define (enq! q obj) (let ((h (cons obj '()))) (if (null? (car q)) (set-car! q h) (set-cdr! (cdr q) h)) (set-cdr! q h)) q) ;;; q-pop! q ;;; Take the front of Q and return it. (define (q-pop! q) (q-empty-check q) (let ((it (caar q)) (next (cdar q))) (if (null? next) (set-cdr! q #f)) (set-car! q next) it)) ;;; deq! q ;;; Take the front of Q and return it. (define deq! q-pop!) ;;; q-length q ;;; Return the number of enqueued elements. ;;; (define (q-length q) (length (car q))) ;;; q.scm ends here