newlispfanclub.alh.net

eddier

Look at Sam Cox's version. Here is his algorithm with a few minor changes. Note everything is a pure function with no side effects! (define (->roman n) (let (roman-a '((100 "C") (99 "IC") (90 "XC") (50 "L") (49 "IL") (40 "XL") (10 "X") (9 "IX") (5 "V") (4 "IV") (1 "I"))) (define (roman-aux result n ...

eddier

Lutz, I've been trying to recode some of my recursive routines to iterative ones. The iterative versions aren't nearly as elegant. For example, recoding a recursive roman numeral conversion to an iterative version looks horrible (below). Looks even worse to maintain, but you're right, it runs signif...

eddier

Thanks Lutz,

Dmi posted the dynamic scoping/recursion trick. Credit where credit is due.

Eddie

eddier

Lutz, To unreferece memory, do I need to make sure no variable or function is bound to the referenced memory, or do I need to delete the context? I think this is just a question of programming style. There is always the possibility to recode a recursive algorithm in a linear, iterative fashion. Trad...

eddier

I really admire Lutz and I think he is genuinely a nice guy, but Qrczak points out two particular problems with newlisp for my current problems: (1) Copying the whole data structure on each function invocation makes my recursive algorithms very memory inefficient (most of the time worse than O(N^2))...

eddier

Yep you are right!

Ed

eddier

Oops.

Code: Select all

(define (random-sequence n m)
    (let (L (sequence n m))
      (map (lambda (x) (pop L x)) (rand m m))))

Ed.

eddier

Another version.

Code: Select all

(define (random-sequence n m)
    (let (L (sequence 1 10))
      (map (lambda (x) (pop L x)) (rand m m))))

Ed

eddier

I'm sorry I couldn't help.

Eddie

eddier

Maybe I still don't get it, but what about.

Code: Select all

(eval-string (append "(define data '" (read-file "fname") ")"))

Afterwards, data will have the unevaluated S-expression from the file.

Eddie

eddier

If you are reading from a file:

Code: Select all

(eval-string (read-file "filename"))

If you just want to evaluate something from the console

Code: Select all

(eval-string (read-line))

Hope this helps.

Eddie

eddier

Mine keeps the same size too. I'm using Debian testing with the 2.6 kernel. I think thats suppose to use and update the latest libraries. I update every day. But, sometimes cutting edge is a drag because I will get a testing version (broken) of software that over writes a working version.

Eddie

eddier

Thanks Sammo!

Works like a charm :) I didn't know I could use "apply" on functions with a variable number of arguments without defining a lambda or helper function. I can use this knowlege to make more elegant solutions for a lot of other functions as well :)

Eddie

eddier

Lutz, I've found use on several occasions to have an optional list of variables or values in format. For instance, suppose L = ("bob" "this" "that" 3 2 10 "a" 96 "----" 456). We could write (println (format "%s,%d,%s,%d\n" (select L 0 4 1 7))) vs (println (format "%s,%d,%s,%d\n" (L 0) (L 4) (L 1) (L...

eddier

Yes,

I was wondering why doesn't map take implicit indexing instead of implicit slicing?

Would it not be more appropriate for map to take indexing? Why would we ever want map to be slicing?

Thanks!

Eddie

eddier

Suppose (define data '((1 2) (2 3) (3 4))) (println (map first data)) => (1,2,3) Okydoky! That's what I expect. But, (println (map 0 data)) => ((1 2) (2 3) (3 4)) and (println (map 1 data)) => ((2) (3) (4)) Looks like (map n list ) means appling ( n sublist) instead of (sublist n ). Shouldn't this b...

eddier

Try the following

Put a replace around whatever accesses the URL field. That is ...

Code: Select all

(replace " " (whatever gets the URL field) "_")

Eddie

eddier

I know html is not xml but I have used

Code: Select all

<td>&nbsp;</td>

to make tables appear correctly in the past. maybe something like

Code: Select all

<Var2>&empty;</Var2>

.

Eddie

eddier

I was thinking more

Code: Select all

(idx1 idx2 list) 

(2 4 '(a b c d e f g)) => '(c d e)

But I'm not sure. The only thing that might be confusing is the position of the number. I still get confused on set-nth and nth-set. There might be a similar problem with implicit indexing and slicing.

Eddie

eddier

Actually I have done that it in the past when I worked with Windows. I created a batch file with something like that with programs before. The person could drop the file on the icon and it would run. If I remember correctly ??? newlisp prog %1 where the %1 was the file that got dropped. If you want ...

eddier

Opps, I didn't see the slice up there. Wouldn't the semantics indicate

Code: Select all

(2 '(a b c d e f g) 3) =>
('(c d e f g) 3) =>
f

?

eddier

Would something like

Code: Select all

(0 3 '(a b c d e)) => (a b c d)
(1 2 '(a b c d e)) => (b c)

?

Eddie

eddier

I absolutely LOVE the implicit indexing Lutz. Just one question, can we do something with rest in a similar manar?

Eddie

eddier

Neat! I've not seen anything quite like this before. The first thing after a non-quoted list is not interpreted as a function.

Code: Select all

> (setq a '((1 2) 3))
((1 2) 3)
> (a 1)
3
>

Thyping (a 1 2) is as easy to type as a[1][2] and maybe as easy to read?

Eddie

eddier

Neat! I've not seen anything quite like this before. The first thing after a non-quoted list is not interpreted as a function.

Code: Select all

> (setq a '((1 2) 3))
((1 2) 3)
> (a 1)
3
>

Thyping (a 1 2) is as easy to type as a[1][2] and maybe as easy to read?

Eddie

newlispfanclub.alh.net

Search found 294 matches

roman numerals revisited

format

strange mapping

indexing

implicit indexing

implicit indexing