Search found 71 matches
- Fri Jan 08, 2010 11:16 am
- Forum: Common Lisp
- Topic: problem with cl-who
- Replies: 2
- Views: 4577
Re: problem with cl-who
WITH-HTML-OUTPUT has two required parameters, but you provided only one.
- Mon Dec 14, 2009 11:38 am
- Forum: Common Lisp
- Topic: request http with common lisp
- Replies: 1
- Views: 3844
Re: request http with common lisp
Drakma can be used to get the page, and Closure HTML to parse it.
- Tue Dec 01, 2009 6:38 am
- Forum: Common Lisp
- Topic: Need help translating Lisp code into C#
- Replies: 2
- Views: 5207
Re: Need help translating Lisp code into C#
I don't know C# enough to tell you how to implement this, but I'll try to explain what these functions do. I believe that you would use different data structures in C# (and in modern Common Lisp, too, actually). (defun COUNT-HIGHEST (lists) "Returns the highest occuring pattern in its arg."...
- Sun Nov 29, 2009 6:03 am
- Forum: Common Lisp
- Topic: Different behavior of SBCL and CLISP on 'directory' function
- Replies: 1
- Views: 3853
Re: Different behavior of SBCL and CLISP on 'directory' function
I guess that your problem is the "*.*". While a special significance is often assigned to the last dot in a filename (the part after it being treated as an "extension"), for naming purposes this is irrelevant---EXCEPT in some operating systems like DOS (and Windows, which is base...
- Thu Nov 26, 2009 10:21 am
- Forum: Other Dialects
- Topic: mixing dialects?
- Replies: 6
- Views: 16425
Re: mixing dialects?
Yes, with the lisp overlay.dmitry_vk wrote:The only Lisp-friendly Linux distributive is Gentoo at the moment. Usually, Gentoo contains latest versions of most Lisp libraries.subhuman wrote:seems as if debian isn't much lisp-a-lized, is it? i'll have to install cl-gtk2 manually. anyway, many thx for the links.
- Thu Nov 19, 2009 3:44 am
- Forum: Common Lisp
- Topic: Number of levels in a tree
- Replies: 15
- Views: 19335
Re: Number of levels in a tree
Formatted. You can useMinato wrote:this is my code:
Code: Select all
(defun nivel (l k) (cond ((null (cdr l)) k) ((> (nivel (cadr l) (+ k 1)) (nivel (caddr l) (+ k 1))) (nivel (cadr l) (+ k 1))) (t (nivel (caddr l) (+ k 1)))))
Code: Select all
tags for that.
- Tue Nov 10, 2009 5:05 am
- Forum: Common Lisp
- Topic: Number of levels in a tree
- Replies: 15
- Views: 19335
Re: Number of levels in a tree
the problem is that i cannot use the setq function,and I can't figure out how to store the value of the deepest level found at a certain moment You don't need to store it. Either the right subtree of a node is deeper, or the left one is. So return the greater of the two. And how do you do that for ...
- Mon Nov 09, 2009 9:51 am
- Forum: Common Lisp
- Topic: Number of levels in a tree
- Replies: 15
- Views: 19335
Re: Number of levels in a tree
Perhaps you'd like to look at these hints again. The problem isn't too hard.
- Tue Aug 25, 2009 12:51 pm
- Forum: Common Lisp
- Topic: Better then loop/iterate?
- Replies: 41
- Views: 60495
Re: Better then loop/iterate?
Why don't you use LET* and LABELS then?Jasper wrote: 2) Sometimes need lets or flets in some specific order, causing more nesting.
- Mon Jul 27, 2009 3:31 am
- Forum: Common Lisp
- Topic: Where to start?
- Replies: 20
- Views: 46195
Re: Where to start?
To start with Emacs, just use the built-in tutorial (C-h t). I then printed out some Emacs Cheat Sheet and put it on the wall beside my working place. I think that I saw a SLIME Cheat Sheet somewhere, too. Both also have a quite complete manual, don't be afraid to read them.