Search Results
7/23/2025, 8:30:02 AM
7/15/2025, 2:50:44 PM
7/13/2025, 1:12:41 AM
7/3/2025, 2:19:08 PM
>>105787706
not much to it, its called systems of trust, if you can invent one that is powered by moral goodness you have basically solved humanity. even religion didn't really work.
not much to it, its called systems of trust, if you can invent one that is powered by moral goodness you have basically solved humanity. even religion didn't really work.
ID: /yVATiPL/biz/60572395#60572829
7/2/2025, 6:23:46 PM
The NKE movement just encapsulates how fucking retarded this market is:
>Pumps because of vague Trump tweet about a Vietnam deal
>Dumps below opening price 10 minutes later when it turns out that the deal still involves large tariffs
>Starts pumping again after another 10 minutes because stocks must go up
>Pumps because of vague Trump tweet about a Vietnam deal
>Dumps below opening price 10 minutes later when it turns out that the deal still involves large tariffs
>Starts pumping again after another 10 minutes because stocks must go up
7/2/2025, 5:04:16 AM
6/29/2025, 6:34:34 PM
6/28/2025, 8:08:57 PM
6/25/2025, 3:29:11 AM
6/24/2025, 5:55:04 AM
6/19/2025, 4:32:40 AM
6/10/2025, 12:17:22 AM
>>105540524
>Can Lisp ever be a efficient as C or is it destined to be slower due to the way it was designed?
(define (compile term table reg)
(match term
[(? number? n)
(let ([a (reg)])
(format #t "mov r~a, #~a~%" a n)
a)]
[(? symbol? s)
(let ([a (reg)])
(format #t "mov r~a, r~a~%" a (cdr (assoc s table)))
a)]
[('+ left right)
(let ([a (compile left table reg)]
[b (compile right table reg)])
(format #t "add r~a, r~a, r~a~%" b b a)
b)]
[('let binds scope)
(let* ([syms (map car binds)]
[vals (map cdr binds)]
[n (length binds)]
[regs (iota n)])
(format #t "~:{mov r~a, #~a~%~}" (map cons regs vals))
(set! reg (counter (- n 1)))
(compile scope (append (map cons syms regs) table) reg))]))
(define-syntax test
(syntax-rules ()
[(test program)
(compile 'program '() (counter 0))]))
(test
(+ 2 (+ 3 5)))
mov r1, #5
mov r2, #3
add r1, r1, r2
mov r3, #2
add r1, r1, r3
(test
(let ([a 2]
[b 3])
(+ a (+ b 5))))
mov r0, #2
mov r1, #3
mov r2, #5
mov r3, r1
add r2, r2, r3
mov r4, r0
add r2, r2, r4
screw c i'm already as fast
>Can Lisp ever be a efficient as C or is it destined to be slower due to the way it was designed?
(define (compile term table reg)
(match term
[(? number? n)
(let ([a (reg)])
(format #t "mov r~a, #~a~%" a n)
a)]
[(? symbol? s)
(let ([a (reg)])
(format #t "mov r~a, r~a~%" a (cdr (assoc s table)))
a)]
[('+ left right)
(let ([a (compile left table reg)]
[b (compile right table reg)])
(format #t "add r~a, r~a, r~a~%" b b a)
b)]
[('let binds scope)
(let* ([syms (map car binds)]
[vals (map cdr binds)]
[n (length binds)]
[regs (iota n)])
(format #t "~:{mov r~a, #~a~%~}" (map cons regs vals))
(set! reg (counter (- n 1)))
(compile scope (append (map cons syms regs) table) reg))]))
(define-syntax test
(syntax-rules ()
[(test program)
(compile 'program '() (counter 0))]))
(test
(+ 2 (+ 3 5)))
mov r1, #5
mov r2, #3
add r1, r1, r2
mov r3, #2
add r1, r1, r3
(test
(let ([a 2]
[b 3])
(+ a (+ b 5))))
mov r0, #2
mov r1, #3
mov r2, #5
mov r3, r1
add r2, r2, r3
mov r4, r0
add r2, r2, r4
screw c i'm already as fast
Page 1