newlispfanclub.alh.net

Neat! Shouldn't the respective language version numbers be noted though?

I got the shirt today, it's awesome! I like the design and am very happy about getting it because I need more shirts, so thanks again michael for donating yours! And thanks Lutz for sending it so quickly too!

:-D->-<

^-- Me ecstatic about receiving my new shirt.

Keynote 4.0.1. I tried to do FOOP 3 in After Effects (fantastic program), but it was much more difficult. I'm basically happy with Keynote's results. Ah, that's pretty nifty actually, for some reason I forgot that Keynote could do that, it's a fantastic program. If you're still looking for someone ...

I won?! Wow, thank you, everyone! The last time I won something was for a diorama I built of a Star Wars Lambda-class T-4a shuttle for a model competition back in 1983 :-) I've already begun to design a special, hermetically sealed container/vault for the manual so it can be ready when the precious...

I love these videos! Great job m i c h a e l!

I live in Miami (and sometimes Gainesville) so I could attend, I've been away on vacation the past couple of weeks so I didn't know about this "conference", but yeah, if you guys do it again I'd be happy to stop by and shoot the shit if I can. :-)

cormullion wrote:nice one Lutz!

Code: Select all

newLISP v.9.2.9 on OSX UTF-8, execute 'newlisp -h' for more info.

> (set 'a (array 2 2 (randomize (sequence 1 10))))
((8 7) (2 10))
> (sort a)
((2 10) (8 7))

Awesome! Thanks Lutz! :D

Essentially I wrote a program in newLISP that tried its best to eliminate as many pieces as possible from a ChainShot game. Nice project. Perhaps you could add a GUI to it one day..! Yeah, I think I might actually, once I finish all my finals for school. Then if there's time I might enter it into t...

I implemented a simple memory allocation hack: Wow, that's pretty neat. It's still doing a context-like trick by using named symbols for the pointers, and evaluating a pointer takes log(n) time (b/c of the red-black tree), but that's still a really cool trick. Thanks for sharing! Using this approac...

Perhaps you are looking for is some sort of associative data access. A way to access a piece of information via a key pointing to a data-value. This is what binary-trees are used for in 99% of the cases. Well actually the binary tree was just an example, the original tree that I had in mind was lik...

Are you thinking about speed? The need for speed...?! :) Oh... why yes, most definitely. :) I wonder how big your lists are going to be... What's the application, out of interest? It's for my artificial intelligence final class project. I was originally planning on using a tree, but since I ran out...

Is it possible for there to be a hypothetical built-in function called 'unsafe-ref' that returned an internal reference (pointer) to something? Then you'd be able to do things like this without having to walk down the tree/list twice (once to find the indices, and once again for nth-set to follow th...

Thank you both! Using 'ref' and 'nth-set', that's what I was looking for! Coming from far-away lands that always had references, I'm not used to this method of mutably modifying things.

Thanks again!

OK, I fixed the problem, the code had a bug in the indexing, it should be: (define (TREE-label tree) (tree 1)) (define (TREE-left tree) (tree 2)) (define (TREE-right tree) (tree 3)) (define (set-TREE-label tree value) (nth-set (tree 1) value)) And also, I was right, this method does not allow you to...

Thanks for your replies and the binary tree example, but I'm still worried that it won't work the way I want. For example, what will this do: (set-TREE-label (find-subtree tree 5) 2000) Will that update what's in the tree itself, or will that only update a copy of what was in the tree? Edit: I'm try...

My second contribution is (although still in progress) (load " http://www.nodep.nl/downloads/newlisp/nlist.lsp ") Wow, I just spent some time using that to go through the newLISP files on your server, they're amazing! My favorite has to be worm.lsp! Great job! :-D And I love how you can load them j...

On a similar note, how would one implement something like a binary search tree in newLISP without having to generate named contexts? It doesn't seem ... possible.

Cyril wrote:Oops! Wrong! It's O(n)! Very, very evil typo. Sorry, folks. And nobody have corrected me. :-(

Are you saying that's what I get for trusting you? ;)

Yeah. That's a problem I think... Lutz?

However, none of the newLISP users from this forum are into IRC, so the channel has been quiet for most of the year. Ah, oh well. It's just nice sometimes when you're a newLISPnewBIE and have a question that needs a quick answer. But if you like talking to yourself, it's kind of fun... :) I might t...

Thanks guys!

Lutz wrote:For 'last' the optimization was never done, but is trivial to add for 9.2.9.

That would be just hunky-dory! :-D

I'm trying to create a tree class using the data-type macro Lutz introduced . The class is created like so: (data-type (tree data children)) data can be anything, and children is a list of other trees. So say I want to define a function (or macro, don't know which) called tree:add-child that takes a...

Does (length) calculate the size of a list by iterating through its elements or is there a value stored somewhere internally?

OK, this is getting frustrating, I'm starting to get the impression that newLISP just isn't designed for object oriented programming (edit: which appears to be what Lutz said above, now that I'm reading through this thread in more detail...). Using my previous code this does not work: (set 'points '...

OK, I haven't been able to figure out how to get it working using the previous paradigm, but I did fix it by changing the semantics a bit. The data-type function is the same except the setter/getters are functions instead of macros: (define-macro (data-type) (let (ctx (context (args 0 0))) (set (def...

Is there an IRC channel for newLISP? I think it would be really helpful to the entire community if there was...