John Clements wrote at 09/13/2010 11:44 PM:
Again, this change would seem to be designed to allow developers to create and
use their own interpreted languages within apps, as long as they aren't
downloaded, which would open up a gaping security hole.
I think that is not so much about security
From this week's TidBITS, welcome news that the evil section 3.3.1 has been
stricken from the developer agreement, and that Apple has lifted the completely
insane ban on interpreted code.
**App Development Language Restrictions Lifted** -- Let's look next at
the changes to the iOS Developer Lic
Suppose I have these definitions in a BSL file:
(define-struct fighter (desig accel speed range))
(define fighter1 (make-fighter "F22" 75 200 350))
Now, in a separate 'teachpack' (written in #lang racket), I have an
exported function that processes the 'fighter1' value. But why does
struct->ve
Chris Stephenson wrote:
But, on the other hand, O(log n) is, for most practical purposes, very
close to O(1), so why worry?
Because we're not consistent about when we worry and when we don't. This
thread, for example, is mostly about logarithmic factors. And we
wouldn't accept a statement li
Stephen Bloch wrote at 09/13/2010 06:12 PM:
Actually, since RAM exists in 3-dimensional space, the propagation delay to the
memory cell you want is at least the cube root of the memory size; even log(n)
is unrealistically optimistic.
If you're going to get into physics, Feynman did some cu
On Sep 13, 2010, at 5:19 PM, Chris Stephenson wrote:
> ram access takes O (log n) time, where n is the RAM
> size supported by the word length. And if you have some kind of memory
> hierarchy (cache and RAM, or cache, RAM and disk) then things are definitely
> not really going to be O(1) when y
Oh, right! The slideshow/play library had to add that support.
Sorry for the misleading answer.
Robby
On Mon, Sep 13, 2010 at 4:46 PM, John Clements
wrote:
>
> On Sep 13, 2010, at 2:41 PM, John Clements wrote:
>
>> I'm giving a talk (google-ignite-style) where the slides are supposed to
>> aut
On Sep 13, 2010, at 2:41 PM, John Clements wrote:
> I'm giving a talk (google-ignite-style) where the slides are supposed to
> auto-advance every 15 seconds. I don't see any support for this, and it looks
> like the easiest way to hack it in is just to modify the viewer so that it
> starts a t
That sounds right to me. Use queue-callback from the thread to make
sure you don't introduce unwanted concurrency. (You might look and see
how the space callback is implemented.)
Robby
On Mon, Sep 13, 2010 at 4:41 PM, John Clements
wrote:
> I'm giving a talk (google-ignite-style) where the slide
I'm giving a talk (google-ignite-style) where the slides are supposed to
auto-advance every 15 seconds. I don't see any support for this, and it looks
like the easiest way to hack it in is just to modify the viewer so that it
starts a thread that sends itself "next slide" messages every 15 secon
> You get some very funny timings, because
> Python arrays are not so simple. Or they weren't, the last time I tried
> this.
They haven't become simpler. Ditto for every other scripting
language, because the arrays are really hash table references.
Shriram
___
On 13/09/10 23:19, Prabhakar Ragde wrote:
> One of the things that irritates me about a conventional algorithms
> course is that the underlying model is so fuzzy. When we talk about an
> input of size n, we are really assuming a RAM model with word size c log
> n for some constant c big enough to i
On 9/13/10 2:46 PM, Stephen Bloch wrote:
Do you know a better way to shuffle a list than to convert it to a
vector, shuffle in place, then convert back to a list? You might look
at this discussion:
http://groups.google.com/group/comp.lang.scheme/browse_thread/thread/24270db01f684439/e54c99564028
On Sep 13, 2010, at 3:07 PM, David Van Horn wrote:
>> In fact, ANY method to do this (even with a vector) takes Omega(n log n)
>> time. It needs to be able to produce any of n! different answers, so it
>> needs to make at least log(n!) decisions, which is Theta(n log n).
>> Otherwise there wouldn
Fisher-Yates is O(n). It visits each element once, choosing a random
equal-or-forward element and swapping it with the current element. And it
is fair in the sense that, given a proper random-number generator, each
permutation of the input is equally likely.
All of the purely-functional methods
David Van Horn wrote:
On 9/13/10 2:46 PM, Stephen Bloch wrote:
On Sep 13, 2010, at 1:34 PM, Phil Bewig wrote:
Do you know a better way to shuffle a list than to convert it to a
vector, shuffle in place, then convert back to a list? You might look
at this discussion:
http://groups.google.com/gr
On 9/13/10 2:46 PM, Stephen Bloch wrote:
On Sep 13, 2010, at 1:34 PM, Phil Bewig wrote:
Do you know a better way to shuffle a list than to convert it to a
vector, shuffle in place, then convert back to a list? You might look
at this discussion:
http://groups.google.com/group/comp.lang.scheme/br
On Sep 13, 2010, at 1:34 PM, Phil Bewig wrote:
> Do you know a better way to shuffle a list than to convert it to a vector,
> shuffle in place, then convert back to a list? You might look at this
> discussion:
> http://groups.google.com/group/comp.lang.scheme/browse_thread/thread/24270db01f684
On 9/13/10 1:34 PM, Phil Bewig wrote:
Fixed. See the comment at
http://programmingpraxis.com/2009/12/11/selection/.
Prabhakar: You are correct that shuffling once at the beginning is
sufficient. But I am interested in your critique of shuffling. Do you
know a better way to shuffle a list tha
Fixed. See the comment at
http://programmingpraxis.com/2009/12/11/selection/.
Prabhakar: You are correct that shuffling once at the beginning is
sufficient. But I am interested in your critique of shuffling. Do you know
a better way to shuffle a list than to convert it to a vector, shuffle in
~~
4th European Lisp Symposium
Special Focus on Parallelism & Efficiency
March 31 - April 1st, 2011
TUHH, Hamburg University of Technology
You didn't define the datatype.
Shriram
On Mon, Sep 13, 2010 at 7:12 AM, wooks . wrote:
> Trying out the first example in the book
>
> #lang plai
> (define (parse sexp)
> (cond
> [(number? sexp) (num sexp)]
> [(list? sexp)
> (case (first sexp)
> [(+) (add (parse (second sex
Trying out the first example in the book
#lang plai
(define (parse sexp)
(cond
[(number? sexp) (num sexp)]
[(list? sexp)
(case (first sexp)
[(+) (add (parse (second sexp))
(parse (third sexp)))]
[(-) (sub (parse (second sexp))
(parse
Isaiah Gilliland wrote:
I've been trying to figure out how to create a cli app. My first issue is to
create a prompt for the user to enter text so I can use what they enter.
I've somewhat found out how to make outside commands to other programs, but
I've ben scouring the documentation for some t
Some more info, in case someone else hits this problem and needs to
debug before I can get back to it...
After dumbing-down the crypto in use for SSL so that Wireshark could
decrypt... It appears that PLT (for whatever reason, possibly my data)
is not sending the client certificate or doing ve
25 matches
Mail list logo
