|
Mar
21 |
|
comment |
Is it possible to implement `apply` in a Lisp using `eval`? Something you have to consider is that eval calls apply. So if you define my-apply by calling eval which in turn calls apply, have you really defined my-apply without using apply? |
|
Mar
2 |
|
awarded | Yearling |
|
Mar
2 |
|
awarded | Yearling |
|
Feb
6 |
|
awarded | Yearling |
|
Jan
21 |
|
revised |
Java memory management (thunks/lazyness) added 16 characters in body |
|
Jan
21 |
|
revised |
Java memory management (thunks/lazyness) added 241 characters in body |
|
Jan
21 |
|
answered | Java memory management (thunks/lazyness) |
|
Jan
20 |
|
awarded | Nice Answer |
|
Jan
19 |
|
awarded | Peer Pressure |
|
Jan
6 |
|
comment |
Clojure: Implementing Seqable for an existing java class Thank you, I wonder whether it would have been possible when clojure was designed to make Seqable a protocol or whether it really had to be a special case. |
|
Jan
6 |
|
accepted | Clojure: Implementing Seqable for an existing java class |
|
Jan
6 |
|
revised |
Clojure: Implementing Seqable for an existing java class added 51 characters in body |
|
Jan
5 |
|
asked | Clojure: Implementing Seqable for an existing java class |
|
Dec
1 |
|
comment |
algorithm for project euler problem no 18 It is like Project Euler and Jimmy Hoffa say: There is a very efficient way to solve the problem without trying every route. |
|
Dec
1 |
|
revised |
algorithm for project euler problem no 18 added 18 characters in body |
|
Dec
1 |
|
answered | algorithm for project euler problem no 18 |
|
Oct
7 |
|
comment |
What does using (vec col) or (vector arg1 & args) cost? For the most part while doing those exercises, you probably don't want to be using vec or vector but should instead prefer the generic seq operations. vec and vector actually build a vector which costs time and space. For example problem 1 asks you to write the last function. Since the core last function only uses the seq operations I can quickly do (last (range 10000000)) on my machine but doing (last (vec (range 10000000))) waits a minute and then gives me an OutOfMemoryError
|
|
Sep
21 |
|
awarded | Custodian |
|
Sep
8 |
|
comment |
Joining two tables using third as linking table, including null entries I believe that all you're looking for is a LEFT JOIN on stage instead of a regular (INNER) JOIN |
|
Sep
7 |
|
comment |
"Programming Pearls" binary search help @Geek In that sentence, the first list refers to 000, 001. (the second list would be 110, 100, 111). By smaller I mean that there are fewer elements in it. The big O(n) complexity depends on what you want to be the "n" (is n in this case 32 bits or is it 2^32 possible numbers or is it four billion selected numbers) |
