Perhaps by setting '*Prompt'?
ww https://software-lab.de/doc/refP.html#*Prompt
☺/ A!ex
Thanks for the tip! I think I'm on to something...
: (de *Prompt (cond ((isa '+Fixed @) (format> @)) (T "")))
# *Prompt redefined
-> *Prompt
:
: (fixed 1234 2)
-> $171307330464572
12.34: (fixed+ @ (f
May 3, 2020 1:13 AM, "Wilhelm Fitzpatrick" wrote:
> I'm not finding such a thing in the function reference, but asking on the off
> chance I'm
> overlooking it. Is there a way in Picolisp to get a division result and
> remainder as a single
> operation?
Sure
http://ix.io/2kBM
--
UNSUBSCRIBE:
Hello all,
I would like to ask that structure sharing is used in pil32 bigNums or not ?
In doSub(), doAbs() it uses structure sharing, but otherwise in big.c
it copies the argument then modifies it.
Thanks,
Andras
--
UNSUBSCRIBE: mailto:picolisp@software-lab.de?subject=Unsubscribe
I'm not finding such a thing in the function reference, but asking on the off
chance I'm
overlooking it. Is there a way in Picolisp to get a division result and
remainder as a single
operation?
Sure
http://ix.io/2kBM
Thanks! But as Alex intuited, I was looking to leverage the underlying
p
For heavy number crunching, picolisp might not be appropriate. In modern
systems you would probably want something that used the vector
instructions. But if it’s a few divisions here and there, you’d be
surprised how little the efficiency in clock cycles matters anymore.
On Sun, May 3, 2020 at 14
Certainly you've heard of Fusion² Trees, Exponential² Trees, Ryabko³ Trees,
Bit Twiddling Hacks⁴ in C ... this is, what i consider the high class of
programming excellence, every programmer not only should have heard of, but
also should have implemented on his/her own.
This class of algorithms sho
I took my algorithms class from one of the inventors of fusion trees. It’s
more of a stunt than anything else. He invented it just to prove the point.
The constant factor of each operation dwarfs the comparison it avoids. But
the big-O is relatively small. They are still impractical.
Pico operates
Plain wrong. Christian Schafmeister will teach you the use of Lisp in
high(est) end number crunching:
https://youtube.com/watch?v=8X69_42Mj-g
He's the Super Brain behind all the compute stuff of that famous Genomic
Reasearch Institute in NY (proteine folding ... Corona) ... ;-)
In fact, he's usi
Certainly, Fusion Tree, as well as the successor, Exponetial Tree and
especially Van Emde Boas Tree have certain "overhead". But it pays off
quickly at search through huge data on terabyte+ SSDs, you even can find in
any home today.
Remember: "You'll never become a car even if you put your body in
"Pico operates on lists. Its fundamental data structure tends toward linear
algorithms."
This is what you've been told? Plain wrong!
(cons(cons(A B) C) already is a minimal (directed) graph.
What does that (200 lines of C) Lisp implementation tell you?
typedef struct List {
struct List * nex
Isn't Christian Schafmeister the guy attempting to make a Common Lisp frontend
to the dreaded LLVM infrastructure?
SCNR 😇
Am 3. Mai 2020 23:17:49 MESZ schrieb Guido Stepken :
>Plain wrong. Christian Schafmeister will teach you the use of Lisp in
>high(est) end number crunching:
>
>https://youtu
Hi Andras,
> I would like to ask that structure sharing is used in pil32 bigNums or not ?
> In doSub(), doAbs() it uses structure sharing, but otherwise in big.c
> it copies the argument then modifies it.
Correct. And also in pil64 and pil21.
All other arithmetic operations except add/sub cannot
13 matches
Mail list logo
