generalisation of PEEK-CHAR?
I'm looking for a generalisation of the CL PEEK-CHAR function that
enables you to peek at the first character of a stream. The
generalisation I am after is a function that enables you to peek at
the nth character. I cannnot find any obvious way of doing this in CL
and wondered how it might be done and how other Lisps stood wrt to
this function.
Mark
|
9/8/2010 12:37:49 PM
|
1
|
Mark Tarver <dr.mtar...@ukonline.co.uk>
|
|
|
Benchmarking differerent Common LISP implememtations with very simple ad hoc tests
I have been collecting various Common LISP implementations for my
scientific work. As the LISP implementation that I will use I chose
the Franz (TM) Allegro Common LISP (TM). The reason is that it is a
commercial-quality product -- I have seen that with these LISP
versions, so to speak, "What You Get is What You Pay".....
I wrote a very simple set of functions to compare these LISP
implememntations to each other. The function (common-lisp-test)
calculates some extremely well-known mathematical constants. Timing
that function, with
=> (time (common-lisp-test))
gives very int
|
9/7/2010 4:16:30 PM
|
1
|
Antti J Ylikoski <antti.yliko...@elisanet.fi>
|
backquote & quote
Hello,
I'm implementing a list reader for a subset of common lisp and I ran across
an interesting thing concerning backquote:
;; This is with SBCL:
* '(`(1 2 3 ,(+ 4 5)))
(`(,1 ,2 ,3 ,(+ 4 5)))
* (car '(`(1 2 3 ,(+ 4 5))))
`(,1 ,2 ,3 ,(+ 4 5))
* (cdar '(`(1 2 3 ,(+ 4 5))))
(1 2 3 (+ 4 5))
My question is, how would backquote and unquote be implemented in order
to give me such an answer?
When you see something like:
`(1 2 3 ,(+ 4 5))
It could be represented as:
(BACKQUOTE (1 2 3 (UNQUOTE (+ 4 5))))
In fact, using the chicken scheme interpreter:
#;4>
|
9/8/2010 4:02:57 AM
|
2
|
Peter Keller <psil...@cs.wisc.edu>
|
macro output
Hello,
Can a lisp macro produce an output to the reader which is not readable via
(read)? If so, what would be an example of use?
-pete
|
9/8/2010 12:37:48 AM
|
5
|
Peter Keller <psil...@cs.wisc.edu>
|
Re: Light-weight class redefinition semantics for CLOS.
On 2010-09-07 06:44:57 +0100, Kenneth Tilton said:
> For the Hard of Reading(tm): CLOS is a bloated pig which has taken on a
> life of its own such that we find ourselves programming CLOS instead of
> our applications.
It really isn't. People make it out to be, and then people like me get
interested and start exploring all sorts of interesting edge cases
which makes it look complicated, or playing withthe MOP &c. But for
normal use it's delighfully simple to express what you mean. Compared
to most other object systems CLOS is an absolute pleasure to use: you
can say what
|
9/7/2010 8:53:38 AM
|
1
|
Tim Bradshaw <...@tfeb.org>
|
[LibCL-devel] A brave new world
Hi all,
Sorry for sending this on multiple channels, but LibCL is undergoing a
major redesign. Feedback and even help would be appreciated.
Read the announcement at
http://lists.libcl.com/pipermail/libcl-devel-libcl.com/2010-September/000118.html
Thanks,
Daniel
|
9/7/2010 6:52:05 AM
|
0
|
D Herring <dherr...@at.tentpost.dot.com>
|
Re: Light-weight class redefinition semantics for CLOS.
On 2010-09-03 17:50:24 +0100, Tim Bradshaw said:
> Something like that should be fairly easy to arrange with the MOP I
> think, though it breaks some things one might want to assume are true -
> in particular (eq (find-class (class-name x)) x) may no longer be true.
Thinking about this, I think it's much easier than it might seem. What
you need is a "public" class C, which knows what its "actual" class is,
where its actual class is probably a "private" subclass of it. You
need a couple of utility functions (well, you don't need them, but it
makes life easier): MAKE-ACTUAL-I
|
9/6/2010 7:46:10 PM
|
1
|
Tim Bradshaw <...@tfeb.org>
|
Problem with destructuring bind macro
Hi,
I'm trying to right a macro whereby a lambda expression can
destructure its arguments. I've come up with
(defmacro db-lambda (args &body body)
"A lambda that takes a destructuring lambda list"
(let ((x (gensym)))
`(lambda (,x)
(destructuring-bind ,args ,x
,@body))))
This works fine in some circumstances - for example
* (mapcar (db-lambda (x y) (+ x y)) '((1 2) (3 4)))
;
(3 7)
However the following fails with an illegal function call error
* ((db-lambda (x y) (list y x)) (list 3 4))
; Error: Illegal func
|
9/5/2010 10:26:21 AM
|
3
|
Alex McGuire <cage...@gmail.com>
|
Is this a bug in LISP?
Hi,
I'm using GNU CLISP 2.48. I've caught LISP making a pretty grievous
math error, and I don't know if it's a bug or if there's another
explanation.
I input this line:
(+ 0.2 0.4 0.2 0.2 9.8 15.4 1.2 5.4)
And I get this result:
32.800003
Obviously this answer is off by .000003. Could somebody explain to me
why this is, and if there's a way to add these numbers correctly using
CLISP?
|
9/5/2010 6:10:20 AM
|
13
|
Paul G <pavel...@gmail.com>
|
Energy Saving Tips
1. Reduce heater's room temperature
For each extra degree (Celsius) of temperature, your heater will
consume 7 to 11%
more energy. Adjust it to 18degrees which is also better for your
health.
2. Install a programmable thermostat
You will be able to control the heater's temperature during specific
hours every day.
3. Insulate your house
Loss of heat is loss of energy.
4. Fix air leaks
5. Close the chimney of the fireplace when you don't use it
It is designed to drive smoke (hot air) out of the house!
6. Get an energy audit to advice you about the necessary fixes and
insulation
7.
|
9/4/2010 7:28:10 PM
|
0
|
"......" <sustainable.future...@gmail.com>
|
Load-time evaluation of compound form operators.
Usually the operator of a compound form is evaluated for its
functional value at execution time [1].
What if this evaluation of functional value of operators was rather
done at load time? What would be the consequences?
One obvious consequence would be that some form of forward
reference to function definition would have to be provided by mean
of back-patching or something equivalent. But this is hardly new
and unusual since compilers and linkers in other languages have been
handling such things for many decades now.
Another one is that in a multi-threaded context the followin
|
9/4/2010 11:54:32 AM
|
16
|
Jean-Claude Beaudoin <jean.claude.beaud...@gmail.com>
|
Concurrency Support in CL
Hi all,
Before I got into Haskell programming a few years (4) ago I studied
"Practical Common Lisp". I really enjoyed it and am looking to get
back into the Lisp world. As a lot of my application development has
become server development and so good support for persistent shared
state and concurrency are important in choosing a Lisp. Clojure has
addressed this need well which makes it a compelling choice, but I
don't want to give up CLOS and the many other features that I liked
about CL. Has there been any CL development in this space since I last
left that make it competitive with Cl
|
9/3/2010 2:54:21 PM
|
4
|
deech <aditya.si...@gmail.com>
|
Light-weight class redefinition semantics for CLOS.
There exists a very simple alternative to the current class
redefinition semantics of CLOS that avoids all the thread-safety
issues of the lazy instance updating feature mandated by
the current specification.
This alternative is simply to always create a completely new
class object, that is a new instance of standard-class with
a new identity, every time defclass is invoked.
In this scheme there is no automatic updating of any instance
outside the control of the application code. Any instance
update has to be done under application control, at a time
and in a context of its cho
|
9/3/2010 1:16:09 PM
|
5
|
Jean-Claude Beaudoin <jean.claude.beaud...@gmail.com>
|
no warning on unused variable
should this produce a style-warning about unused variable A?
(compile nil (lambda () (let ((a nil)) (setq a 1) t)))
here A is set but never read so it is not really used and a compiler
would obviously eliminate it producing something equivalent to (lambda
() t).
does this situation warrant a warning, like (lambda () (let (s) t))
does?
|
9/2/2010 9:02:55 PM
|
3
|
sds <sam.steing...@gmail.com>
|
how to get list of vectors with value from file content...
a pure academic question on emacs lisp.
basically, i want to set a variable who's value is a list of vectors,
each vector is a pair.
Like this form:
(setq findReplacePairsList (list [A B] [A B] [A B]) )
the element of the vector are strings, each are read from a file
content.
(i have 6 files, corresponds to the 3 vectors above.)
i have 2 questions.
(1) here's how i get the file content for each file:
(find-file "findreplace_01_A.txt" ) (setq findreplace_01_A (buffer-
string)) (kill-buffer )
(find-file "findreplace_01_B.txt" ) (setq findreplace_01_B (buffer-
string)
|
9/2/2010 10:17:02 AM
|
3
|
Xah Lee <xah...@gmail.com>
|
common-lisp-controller vs. asdf-install
Hello,
I see that debian/ubuntu use common-lisp-controller to package
libraries. Cliki, OTOH, seems to prefer asdf-install. Unfortunately, many
packages are missing from debian/ubuntu. What would be the proper way to
install additional packages on those machines? Install asdf-install in
parallel? Or tell common-lisp-installer how to install asdf-install'able
packages?
|
9/1/2010 9:36:44 PM
|
26
|
Josef Wolf <...@raven.inka.de>
|
ITA, move over!
Got my first school user! Not paying, of course....
If you are wondering why this software is so great, I explained it here:
http://www.stuckonalgebra.com/advantages.html
Hey, Google! Over here!
:)
kt
--
http://www.stuckonalgebra.com
"The best Algebra tutorial program I have seen... in a class by itself."
Macworld
|
9/1/2010 6:37:43 PM
|
24
|
Kenneth Tilton <kentil...@gmail.com>
|
Initializing slots based on other slot values in Common Lisp Object System class definitions
In my class definition, I want to initialize one slot based on the
value of another slot. Here is the sort of thing I would like to do:
(defclass my-class ()
((slot-1 :accessor my-class-slot-1 :initarg slot-1)
(slot-2 :accessor my-class-slot-2 :initform (list slot-1))))
However this doesn't compile:
1 compiler notes:
Unknown location:
warning:
This variable is undefined:
SLOT-1
warning:
undefined variable: SLOT-1
==>
(CONS UC-2::SLOT-1 NIL)
Compilation failed.
Is there a way to do
|
9/1/2010 4:40:41 PM
|
2
|
Paul Reiners <paul.rein...@gmail.com>
|
Ed Lambda: Functional programming meetup in Edinburgh
Hi guys,
I'm running a meetup for functional programming in Edinburgh. The
first one will be on the 13th of September at Malone's Irish Bar (14
Forrest Road) and will continue every 2nd monday of each month. For
the first meetup I think we'll just be having a chat and getting to
know each other but I hope to be able to expand it to talks and coding
dojos once we have some regular numbers.
For more details: http://meetup.com/ed-lambda/
And we're on Twitter: http://twitter.com/ed_lambda
|
8/31/2010 10:46:18 PM
|
2
|
Ollie Saunders <oliver.saund...@gmail.com>
|
Really done with thread-safe CLOS!
When I started my effort to make thread-safe the CLOS implementation
I use I understood tread-safety in a somewhat naive first level kind
of way. For me CLOS thread-safety meant guaranteeing the coherence
and integrity of the CLOS metadata. I thought such a guarantee was
enough. It seems I was wrong and that there is a second meaning to
CLOS thread-safety that relates to guaranteeing the safe execution of
applications using CLOS even if such code does not do any access
to the CLOS metadata. This second meaning will addressed in my
next post (yes, the one I keep promising). For n
|
8/31/2010 8:33:25 AM
|
0
|
Jean-Claude Beaudoin <jean.claude.beaud...@gmail.com>
|
suppress output to screen
It's probably a simple trick but can't figure it out (mind blocked). I
am storing large data to a file using
(with-open-file (stream "c:/mydata.txt" :direction :output)
(print data stream))
The file created is about 20 MB. I'm using emacs as editor and when I
do the above the file is created but at the same time I have the
content all of it printed to the inferior-lisp REPL.I have to wait
almost 20 minutes for the rows while they are scrolling on my screen.
How can I suppress this output to standard-output? I only need the
data stored in the file.
|
8/31/2010 7:46:36 AM
|
9
|
Francogrex <fra...@grex.org>
|
order of predicate arguments in MERGE
The documentation MERGE function in the CL spec specifies that the
the function takes (among other arguments) sequence-1, sequence-2,
and predicate. It also specifies that three troubling things are true.
1) predicate is always called with first element coming from
sequence-1 and second argument coming from sequence-2.
2) the sort is a stable; if an element from sequence-1 and from
sequence-2 are both equal, the element from sequence-1 will
come first in the restul list.
3) two elements x, and y are considered equal if (funcall predicate x
y) and
(funcall predicate
|
8/30/2010 11:04:02 PM
|
16
|
jimka <ji...@rdrop.com>
|
Example 'best practice' Lisp web application to study?
Can anyone suggest an example of web application written in Common Lisp
which
(1) is open source and can be studied
(2) uses HTML forms to allow the user to add data
(3) uses some form of persistent backing store, probably a SQL database
(4) does all this cleanly and elegantly
I want to get up to speed reasonably quickly with how to do this in Lisp
(I'm proficient in doing it in both C# and Java, and I used to be fluent
in Lisp) in order to evaluate whether Lisp is what I want to use for my
next major project.
--
;; Semper in faecibus sumus, sole profundam variat
|
8/30/2010 6:02:21 PM
|
7
|
Simon Brooke <stillyet+n...@googlemail.com>
|
*Get $5000 Simple hack to your Paypal account
*Get $5000 Simple hack to your Paypal account At http://youcanget.co.cc
i have hidden the Paypal Form link in an image. in that website on
Right Side below search box, click on image and enter your name and
Paypal ID.
|
8/30/2010 10:28:40 AM
|
0
|
Brazil Acctressess <paidi.shivakris...@gmail.com>
|
copy-paste lisp message
I've seen the following sentence copied and pasted many times:
> We invite high quality submissions in all areas involving Lisp
dialects
> and any other languages in the Lisp family, including, but not
limited
> to, ACL2, AutoLisp, Clojure, Common Lisp, ECMAScript, Dylan,
> Emacs Lisp, ISLISP, Racket, Scheme, etc.
Why is SKILL never on that list but racket, and autolisp are. Aren't
there far more active SKILL programmers in the world than Racket?
-jim
|
8/29/2010 4:52:40 PM
|
1
|
jimka <ji...@rdrop.com>
|
Q about Problem 19-2 in "Lisp" by Winston and Horn
Problem 19-2 in "Lisp" by Winston and Horn states, "In depth-first
search, all of the partial paths in the queue at a given point in the
search are related to one another in a simple way: each is the
extension by one node of the partial path after it in the queue. The
queue might, for example, look like this:
((D C B A) (C B A) (B A) (A))
"
However, I don't see how that's the case. For example, I get output
like the following:
(depth-first 's 'f)
queue: ((S))
(S)
queue: ((A S) (D S))
(S A)
queue: ((B A S) (D A S) (D S))
(S A B)
que
|
8/28/2010 7:10:54 PM
|
1
|
Paul Reiners <paul.rein...@gmail.com>
|
Simple hack to get $5000 to your *Paypal account
Simple hack to get $5000 to your *Paypal account At http://youcanget.co.cc
i have hidden the Paypal Form link in an image. in that website on
Right Side below search box, click on image and enter your name and
Paypal ID.
|
8/28/2010 11:29:37 AM
|
0
|
paypal cash <m.bangara...@gmail.com>
|
read-macro question
Hello,
I'm trying to learn about read-macros and have been reading about
them. It is my intention to write a fully functional CL reader--but
I have a long way to go....
Suppose I have this piece of code:
(defmacro while (test &body body)
`(do ()
((not ,test))
,@body))
(defstruct token raw kind)
(defun semicolon-reader (s ch)
(format t "Read: ~S~%" ch)
(let ((comment nil)
(keep-reading t))
(while keep-reading
(let ((c (read-char s nil #\Newline t)))
(format t "Read: ~S~%" c)
(if (char= c #\Newline)
(setf
|
8/27/2010 5:57:22 AM
|
12
|
Peter Keller <psil...@cs.wisc.edu>
|
* Simple hack to get $5000 to your Paypal account
* Simple hack to get $5000 to your Paypal account At http://moneyforwarding.co.cc
i have hidden the Paypal Form link in an image. in that website on
Right Side below search box, click on image and enter your name and
Paypal ID.
|
8/26/2010 4:42:57 PM
|
0
|
paypal cash <kotyada.satya...@gmail.com>
|
ANT like tool written in Lisp
Hello everybody,
I would like to know if there is a tool similar to ANT written in
Lisp. I have done some search over the Internet but have no luck so
far.
Thanks,
Serhiy Y
|
8/25/2010 7:31:31 PM
|
3
|
ysv_ <syako...@gmail.com>
|
Lisp Cabinet [yet another IDE based on Emacs/SLIME]
Lisp Cabinet ( http://lispcabinet.sourceforge.net ) can be viewed as
advanced version of Lispbox IDE for MS Windows (but it doesn't based
on Lispbox). The reason of its creation was lack of ASDF-INSTALL
support by Lispbox for Windows (where configuration of ASDF-INSTALL is
very painful). So, Lisp Cabinet supports ASDF-INSTALL (without cygwin)
for at least two CL implementations - Clozure CL and SBCL. Futhermore,
with Lisp Cabinet you can simultaneously install several additional CL
implementations, Clojure and MzScheme, which is not possible with
Lispbox.
It quite unready though, and
|
8/25/2010 9:38:50 AM
|
2
|
"g. christensen" <gchrist...@gmail.com>
|
Lisp books and Journals archive
In clf, there is a recent topic entitled, "Forth books archive" .
Is there any interest in this newsgroup on a similar Lisp books and
Journals archive ?
Two thin books I would suggest are , I have both paper copies but dont
have any equipment for scanning and would look to others for help.
Lisp : The language of AI, A A Berk
Looking at Lisp, Hosemer
both are fairly thin but self contained books.
Standish P
|
8/25/2010 6:59:24 AM
|
1
|
Standish P <stnd...@gmail.com>
|
CRIMINAL YanQui MARINES BUSTARDS Cesar Laurean Regularly RAPE GIRLS Maria Lauterbach and KILL THEM
CENSORSHIP by GOOGLE NSA BUSTARDS deleted my earlier post dated
Mon, Aug 23, 2010 at 7:33 PM
from google groups. but its archived in the mailing lists linked to
the various newsgroups.
CRIMINAL YanQui MARINES BUSTARDS Cesar Laurean Regularly RAPE GIRLS
Maria Lauterbach and KILL THEM
Is he a Jew or a white Anglo Saxon race ? or a Southern Baptist
Bustard who
The girl was a German like the one Roman Polansky raped, Semantha
Geimer
http://www.cnn.com/2010/CRIME/08/23/north.carolina.marine.murder/
Look at his face, what criminal race is he ? What goes around comes
around !!!
|
8/24/2010 7:36:28 PM
|
0
|
small Pox <smallpox...@gmail.com>
|
Compiler Book
I'm looking to buy a book on compiler implementation.
Am looking at the following ...
1. Crafting a Compiler with C
2. A Retargetable C Compiler: Design and Implementation
3. Compilers: Principles, Techniques, and Tools (2nd Edition)
Would like a book thats not heavy on theory, and takes more of a
practical approach.
Looking forward for some suggestions/opinions from here ...
|
8/24/2010 5:28:23 PM
|
1
|
Vinay <vmco...@gmail.com>
|
ASDF question
Hello,
I have a question about how to write something with ASDF (in sbcl
1.0.41.1).
Suppose I have a project directory layout like this for a package
called 'foo':
foo
foo/src
foo/src/package.lisp
foo/src/foo.lisp
foo/examples/ex1/package.lisp
foo/examples/ex1/ex1.lisp
foo/examples/ex2/package.lisp
foo/examples/ex2/ex2.lisp
The package foo is a library whose source is in foo/src, of
which foo/examples/ex1 and and foo/examples/ex2 are example
applications. There are three packages: #:foo, #:foo-ex1, #:foo-ex2.
I know how to write the asd files (well, I think I do at an
|
8/23/2010 11:52:06 PM
|
10
|
Peter Keller <psil...@cs.wisc.edu>
|
Done with thread-safe CLOS.
Yesterday, after a few days of effort, I finished coding my modifications to the internals of the CLOS implementation I
currently use. So now I have (what I think to be) a thread-safe CLOS environment. I will make it available to you all in
a release I will make a few weeks from now, as soon as I get reasonably convinced that nothing got terribly broken in
the Win64 port by this surgery of the internals (there will also be Linux 32/64 and Win32 versions).
The solution I went for is rather simple (simplistic one may think) but efficient I hope. I defined a macro
"with-metadata-lock
|
8/23/2010 9:15:02 AM
|
17
|
Jean-Claude Beaudoin <jean.claude.beaud...@gmail.com>
|
Bordeaux Threads: Threads not starting (AllegroCL)
Hi all:
I have these simple functions:
;;; AMS I/O THREAD
(defun ams-io-main ()
(format *debug-io* "~%AMS-IO-MAIN: Started.")
(loop
(format *debug-io* "~%AMS-IO-MAIN: Still running ...")
(sleep 3)))
(defun make-ams-io-thread ()
(bt:make-thread 'ams-io-main :name "PIB Connector ams.erp I/O"))
(defun create-ams-io-thread ()
(unless *ams-io-thread*
(setq *ams-io-thread* (make-ams-io-thread))
(mp:process-enable *ams-io-thread*)))
(defun destroy-ams-io-thread ()
(when *ams-io-thread*
(bt:destroy-thread *ams-io-thread*)))
;;; PIB I/O T
|
8/22/2010 1:45:18 PM
|
1
|
Frank GOENNINGER <dg1...@googlemail.com>
|
Searching for .plist file reader/writer in Common Lisp ...
You'd think anyone has done a .plist file reader/writer in CL already.
The usual WWW search tool doesn't turn up anything useful. Some kind
soul out there care to share? Thanks!!!
Frank
|
8/22/2010 11:41:56 AM
|
3
|
Frank GOENNINGER <dg1...@googlemail.com>
|
intersection on many lists
Hi all, I'm asking just in case someone had to do this in CL before:
What is a way to do intersections (and set-difference) on more than 2
lists (many lists): I'm looking in a database where many medications are
given (alone or simultaneoulsy) and I want to make a table of 0s and 1s
for a regression. example:
antibiotic-1 antibiotic-2 antibiotic-3 antibiotic-4: 55 reports;
not(antibiotic-1) antibiotic-2 antibiotic-3 antibiotic-4: 124 reports;
....
not(antibiotic-1) antibiotic-2 not(antibiotic-3) antibiotic-4: 177
reports;
....etc
not(antibiotic-1) not(antibiotic-2) not(antibio
|
8/22/2010 10:01:01 AM
|
12
|
francogrex <fra...@grexdot.org>
|
I HACK $3500 FROM PAYPAL...
I HACK $3500 FROM PAYPAL At http://quickpaypalmoney.tk
i have hidden the PAYPAL FORM link in an image.
in that website on Right Side below search box, click
on image and enter your name and PAYPAL ID.
|
8/21/2010 5:19:29 PM
|
0
|
Hot Hot Hot <m.appalako...@gmail.com>
|
lisp debugger
Hi
Is there a lisp debugger, with breakpoints, to go line by line
and see values changing ?
I'm using emacs/slime/Allegro Express CL on Windows.
|
8/20/2010 6:43:05 PM
|
14
|
=?iso-8859-2?Q?Haris_Bogdanovi=E6?= <fbogdano...@xnet.hr>
|
(Reasonably compact) LISP on ARM?
I'm playing about with moving stuff to an ARM powered server, mainly for
power economy; the box has 512Mb of core, and currently runs Ubuntu 9.04.
There are no Common Lisp implementations in the Ubuntu repository for
ARM, which surprised me slightly. LUSH is also not available from the
Ubuntu repository on ARM (and in any case I have no experience of using
it, although a quick play this afternoon suggested I wouldn't find it
hard). REP is available through a package called librep9, and might be
worth playing with. In any case using a reasonably ANSI-compliant Common
LISP means
|
8/20/2010 5:07:28 PM
|
8
|
Simon Brooke <stillyet+n...@googlemail.com>
|
how to delete text from a list
Hi.
I want to delete list member like:
(setf a '("text1" "text2" "text3"))
(delete 1 a)
but "a" stays the same.
If I have:
(setf b '(4 5 6))
(delete 4 b)
b => (5 6)
I don't know how delete really works ?
Thanks
|
8/20/2010 11:19:38 AM
|
6
|
=?iso-8859-2?Q?Haris_Bogdanovi=E6?= <fbogdano...@xnet.hr>
|
wholesale and retail handbags,brand jewelry on ecshop365
http://ecshop365.com/brandjewelry
jewelry earrings, handcrafted jewelry,
handmade silver jewelry,jewelry designers,
crystal jewelry,rhinestone jewelry,bridal jewelry,amber
jewelry,jewelry store,
jewelry stores,jewelry ring,jewelry rings,vintage jewelry,mens
jewelry,antique jewelry,
buy jewelry,jewelry online,glass jewelry,jewellery jewelry,jewelry
chain,jewelry necklace
HANDBAGS:
www.ecshop365.com
handbags purses,designer handbag hire,handbags ladies,chloe paddington
handbags,
red handbag,authentic designer handbags,evening handbags,discounted
handbags
discount designer handbags
|
8/20/2010 8:26:46 AM
|
0
|
"j&h" <2010leech...@gmail.com>
|
Click the Russian Grial Allbamm at 18to25 age Russian Giral charting and citizenship Jobs details
Click from Russian Giral Allbamm Beautiful profiles with photos and
videos add your proflie for free and start receiving letters and your
Jobs details and Passpost details in p.R in Russian citizenship I
LOVE ALL RUSSIAN
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
http://123maza.com/25/nike286/
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
|
8/19/2010 12:01:24 PM
|
0
|
kuruva k <kuruva...@gmail.com>
|
Interning strings
I know I can intern strings, by putting them in the keyword package, or
in some other by the use of (intern).
But would it be possible, instead of interning them in a package to
intern them in a hash-table. What I mean by this is if I have a
hash-table with strings, I would like every string that is the same as
the other name to be kept in the same memory.
All this is to minimize memory requirments. I basically have a big set
of key/values data, and lots of the keys, and even data are the same.
I have a solution that puts them in the keyword package, or a different
on
|
8/19/2010 1:52:38 AM
|
8
|
"Dimiter \"malkia\" Stanev" <mal...@gmail.com>
|
FLOAT and "mathematically equal"
In the CLHS entry for FLOAT
<http://www.lispworks.com/documentation/HyperSpec/Body/f_float.htm>,
there is the sentence:
If a prototype is supplied, a float is returned that is mathematically
equal to number but has the same format as prototype.
What does "mathematically equal" mean here? 1/3 doesn't (usually) have
an exact floating-point representation, so that 1/3 and the resulting
float can't be mathematically equal.
This must be an editorial mistake.
Perhaps it meant to say the floating point number closest to the
specified number, which makes sense. If you follow the cr
|
8/18/2010 10:07:34 PM
|
1
|
Raymond Toy <toy.raym...@gmail.com>
|
[SICP] newbie question about implementing pairs
Hi
I am reading SICP on my own. I could not understand
(define (cons x y)
(lambda (m) (m x y)))
(define (car z)
(z (lambda (p q) p)))
as presented in exercise 2.4 as an alternate representation of pairs. Please
help me understand it.
Regards
--- news://freenews.netfront.net/ - complaints: news@netfront.net ---
|
8/18/2010 9:13:00 PM
|
5
|
Cross <...@X.tv>
|
new version of ErgoEmacs mode 5.3.4
A new version of ergoemacs-mode.el is out.
The new version is 5.3.4.
New is a Swedish layout, and also the window splitting keys have
changed for the ergonomically better. See the included =93_HISTORY.txt=94
file for more detailed release notes. Thanks to Kristian Hellquist for
the Swedish layout.
Supported layout:
US Contributed by: David Capello
Dvorak Contributed by: Xah Lee
UK Dvorak Contributed by: Phillip Wood
UK Contributed by: Jorge Dias (aka theturingmachine)
Italian Contributed by: Francesco Biccari
Spanish Contributed by: David
|
8/18/2010 6:01:21 PM
|
0
|
Xah Lee <xah...@gmail.com>
|
Turn out the lights
I just installed IE8 to check out a user report of a problem with this
triumph of Lisp, Cells, qooxdoo, and jsMath: http://teamalgebra.com
Installing IE8 over IE7 took about twenty minutes. I think a complete
Ubuntu install is about half that....
They've run up the white flag, Microsoft, haven't they? Not really
trying any more, are they? Sad to see, really, not that I hold any
fondness for the monstrosity. It's just that old phenomenon of sympathy
setting in when the mighty beast is seen to be breathing its last.
kt
--
http://www.stuckonalgebra.com
"The best Algebra t
|
8/18/2010 10:12:53 AM
|
58
|
Kenneth Tilton <kentil...@gmail.com>
|