freenode/#lisp - IRC Chatlog
Search
2:18:21
turkja
Speaking of hunchentoot, now my SSL cert checking application is starting to be in pretty usable shape: https://bitbucket.org/turkja/mitmcheck
2:19:16
turkja
Theoretical question: if i ever wanted to distribute this thing to, let's say windows users, how realistic that would be?
3:00:22
turkja
Guest34211: thanks.. now looking at it, i think it's a good example of why Lisp never conquered the world :) I mean for people who write Lisp programs, setup like that is natural, but for others... not so much :D
3:27:05
aeth
turkja: If C never conquered the world, people would point to its flaws like lack of any safety and the terribly complex way to build things.
3:34:47
turkja
aeth: yeah, you are correct.. historically speaking, i see no reason why lisp is in such a marigin, but as of now, deployment is not very easy.
5:59:07
turkja
jmercouris: some was making a valid not in reddit/lisp: FF57 doesn't anymore have api's needed to run for example Conkeror (afaik - tested it, crash and burn), there definitely is a market for your browser project
7:17:40
beach
emaczen: It is not bound to anything. The meaning of T as a stream depends on the context.
7:35:56
Colleen
Clhs: glossary-section s http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_s.htm#stream_designator
8:33:24
beach
dmiles: SICL doesn't do well at all on ANSI tests, for the simple reason that SICL doesn't exist yet.
10:55:48
Josh_2
I've loaded the library with quicklisp changed into it's package but the examples aren't working
12:54:06
Josh_2
So I'm getting an unhandled memory exception with this code https://pastebin.com/AtCdCTeH I don't understand why as what I'm doing the same thing in another program (sorta) and I'm not getting any errors
12:59:58
Josh_2
I removed the map-into and just used make-array with the argument to initial-element being a funcall (lambda ..
13:00:25
Bike
that will get you an array where all the elements are the same array. i presume you want eleven different arrays.
13:01:08
Bike
(let ((bucket (make-array 11 ...))) (loop for i below 11 do (setf (aref bucket i) (make-array 0 ...))) ...)
13:08:51
Bike
the obvious difference here is that you don't call modified-quicksort. does your bucket-sort manage to get through the first loop, where you do the vector-push-extends?
13:13:45
pjb
Josh_2: showing the source is not enough, you should also show what you did (exactly), [let's assume it's (bucket-sort #(1 3 4 1 2 3 5 9 2 3 6 8 9 3 0 3 4 7 8 4 5 7 0 9 6 4))], and what you got. What condition did you get?
13:14:18
pjb
Josh_2: also, you should provide sources that we can use, we don't have cl-quicksort.lisp, so we cannot run your code.
13:14:48
Josh_2
I realized that after, and I added it into chat. I thought it was crashing because of the bucket-sort but it was because (modified-quicksort ..) sorts based on the car of a list
13:15:42
pjb
Josh_2: and important point to get asymptotic O(n) from vector-push-extend is to pass a value proportional to the length of vector as third argument!
13:16:36
pfdietz
Doubling the size at each extension means the amortized complexity of a v-p-e is O(1).
13:16:58
pjb
Well, with a minimum value, since you initialize them to 0. (vector-push-extend ele (elt buckets ele) (max 8 (length (elt buckets ele))))
13:17:27
pjb
Notice how to get a minimum value, you use max, and to get a maximum value you use min! :-)