Re: Optimizing sort-algorithm
- From: "alex" <alexander.ekart@xxxxxxxxx>
- Date: 27 Feb 2007 06:41:12 -0800
Interesting. On sbcl the code doesn't even get executed correctly:
* (main)
debugger invoked on a TYPE-ERROR:
The value #(26 13 75 70 24 76 63 11 66 0 94 91 ...)
is not of type
(SIMPLE-ARRAY FIXNUM).
Type HELP for debugger help, or (SB-EXT:QUIT) to exit from SBCL.
restarts (invokable by number or by possibly-abbreviated name):
0: [ABORT] Exit debugger, returning to top level.
(NIL #(26 13 75 70 24 76 63 11 66 0 94 91 ...) 10000)
And cmucl refuses cooperation when not adding ":fill-pointer 0" to the
make-array call:
* (main)
#(0 0 ... 0) is not an array with a fill-pointer.
[Condition of type SIMPLE-TYPE-ERROR]
Restarts:
0: [ABORT] Return to Top-Level.
Debug (type H for help)
(VECTOR-PUSH 95 #(0 0 0 0 0 ...))
Source: Error finding source:
Error in function DEBUG::GET-FILE-TOP-LEVEL-FORM: Source file no
longer exists: target:code/array.lisp.
I am a bit confused :)
.
- Follow-Ups:
- Re: Optimizing sort-algorithm
- From: Joel Wilsson
- Re: Optimizing sort-algorithm
- References:
- Optimizing sort-algorithm
- From: alex
- Re: Optimizing sort-algorithm
- From: Wade Humeniuk
- Optimizing sort-algorithm
- Prev by Date: Re: Lisp Syntax - functions versus data
- Next by Date: Re: Optimizing sort-algorithm
- Previous by thread: Re: Optimizing sort-algorithm
- Next by thread: Re: Optimizing sort-algorithm
- Index(es):
Relevant Pages
|
|