Re: declare 64 bit integers?
- From: Nathan Froyd <froydnj@xxxxxxxxx>
- Date: Fri, 28 Sep 2007 14:51:48 -0000
On Sep 27, 3:42 pm, "Alex Mizrahi" <udode...@xxxxxxxxxxxxxxxxxxxxx>
wrote:
j> I'm writing a chess program using rotate bitboards (64 bit integers)
j> (http://en.wikipedia.org/wiki/Bitboard) . Anyways, I'm competing
j> against some people writing the program in Java and C++, and I want to
j> top them when I get mine all compiled. So I know you can declare
j> fixnums (28-bit), but is there any way to declare 64-bit integers to
j> get compiled LISP running super fast?
i'm afraid it won't run "super fast" (if you mean using directly machine
registers/CPU instructions) on any available implementation.
you can pick one -- for example, SBCL -- and ask developers if it's possible
to extend compiler to suport this stuff.
The original poster didn't specify what the target machine was
(although it
sounds like he's using a 32-bit machine), but for the record, SBCL on
x86-64
can do unboxed operations on 64-bit integers just like Java or C++.
-Nathan
.
- Follow-Ups:
- Re: declare 64 bit integers?
- From: Alex Mizrahi
- Re: declare 64 bit integers?
- References:
- declare 64 bit integers?
- From: jrwats
- Re: declare 64 bit integers?
- From: Alex Mizrahi
- declare 64 bit integers?
- Prev by Date: Re: How to implement heap as a binary tree in lisp?
- Next by Date: Re: permutation
- Previous by thread: Re: declare 64 bit integers?
- Next by thread: Re: declare 64 bit integers?
- Index(es):
Relevant Pages
|