laurent.orseau
2021-2-6 14:02:42

I don’t want to register there, but basically there’s not much more to do I think, apart maybe from compiling to an executable (though I’m not sure of the gain).


laurent.orseau
2021-2-6 14:14:37

Is it possible to exclude a definition from all-defined-out but at the definition site? Should be clearer with an example: (provide (all-defined-out)) … (exclude-from-all-defined-out private-function) (define (private-function …) …)


laurent.orseau
2021-2-6 14:21:37

The syntax property 'not-provide-all-definedseems to only work for rename transformers


343519265
2021-2-6 14:25:47

add a scope to definitions and use sites


laurent.orseau
2021-2-6 14:31:39

Thanks, that’s an option indeed, but this requires reorganizing the code and playing with define-values, which is less of a ‘local’ modification than what I ’d like. (Maybe I’ll revert to this if I don’t find something better)


343519265
2021-2-6 14:34:09

I mean something like (define-syntax scoped (let ([intro (make-syntax-introducer)]) (λ (stx) (syntax-case stx () [(_ def) (intro #'def)])))) (scoped (define f 1)) (scoped (+ f))


343519265
2021-2-6 14:34:29

It should not require too much reorganizing


laurent.orseau
2021-2-6 14:39:17

wow, I had no idea this existed, it’s pretty neat! (used by module* and friends maybe?)


shu--hung
2021-2-6 14:42:17

I don’t know about existing solutions, but you can implement a custom provide transformer on top of all-defined-out https://gist.github.com/shhyou/d761013ee0d1ae2cc3d42d5d4750ea4c


laurent.orseau
2021-2-6 14:43:39

That’s a good one too, thanks!


shu--hung
2021-2-6 14:48:52

the scope technique is very useful when you want to introduce some identifiers that are visible only to your macros but not to the users


soegaard2
2021-2-6 15:59:23

Huh? Slack isn’t listed here.


sorawee
2021-2-6 16:00:24

There are two “Community”


sorawee
2021-2-6 16:00:33

One is under the first section


sorawee
2021-2-6 16:00:41

One is under the last section


sorawee
2021-2-6 16:00:57

Slack is in the latter one


soegaard2
2021-2-6 16:02:52

Hmm.


sorawee
2021-2-6 16:03:20

Yeah, I’m not a fan of it. Probably should be merged. Idk.


sorawee
2021-2-6 16:03:58

The first one is limited by its height, so it couldn’t include too many stuff.


sorawee
2021-2-6 16:04:30

But there’s also a lot of wasted horizontal space


soegaard2
2021-2-6 16:05:30

I think, it is confusing. A link from the first section to the last section would help.


badkins
2021-2-6 16:35:04

I fortuitously dodged a bullet by choosing a “mailbox” board representation for my Racket chess engine. I’d forgotten about Racket fixnums being only 60 bits, and a “bitboard” representation makes use of fast 64-bit bitwise operations. Hopefully 60 bits will be sufficient for the Zobrist hashing - I expect it will be.


badkins
2021-2-6 16:38:41

Am I reading the docs for (random) correctly, in that it’s a 54-bit random number?


badkins
2021-2-6 16:39:33

Maybe I should use (crypto-random-bytes n) and convert to a 60-bit fixnum?


soegaard2
2021-2-6 16:41:29

Haven’t checked. If you do, check whether two calls to random are faster than one using the ffi.


shu--hung
2021-2-6 16:42:10

No expert here, but I am thinking about implementing effect handlers in Racket. I am happy to chat.


badkins
2021-2-6 16:42:46

I think I’ll only be using this at program initialization, so in my case, speed isn’t important. Good randomness is more important, as is reproducibility.


shu--hung
2021-2-6 16:43:27

Well, not that I have any specific application, just trying out the examples from the literature (works in the typed land; but the semantics of the effect systems mostly don’t depend on types).


badkins
2021-2-6 16:43:29

I’m a little bummed that I can’t do an efficient 64-bit bitboard implementation, but at the same time I’m relieved that it’s no longer an option :)



ben
2021-2-6 17:20:03

is there a racket video meetup today?


badkins
2021-2-6 17:20:11

Is this the best way to get a 60-bit random number in Racket? (require math/base) (random-bits 60)


soegaard2
2021-2-6 17:51:39

Maybe? It seems it just calls random repeatedly getting 29 bits at a time. The 29 is due to 32-bit systems (minus 3 tag bits).

https://github.com/racket/math/blob/master/math-lib/math/private/base/base-random.rkt#L11


samdphillips
2021-2-6 18:51:31

Yes. In 9 minutes.


samdphillips
2021-2-6 18:52:11

spdegabrielle
2021-2-6 21:24:33

Next Racket users video meet up is 6 March 2021 at 8pm CET, via Gather Town. https://gather.town/app/wH1EDG3McffLjrs0/racket-users\|https://gather.town/app/wH1EDG3McffLjrs0/racket-users Paper for discussion (optional pre-reading) is: To be decided!*

(Note - we do take suggestions if you have something that interests or excites you - and other media would also be considered; blog post, video, package, app - as long as it is Racket related)


gknauth
2021-2-6 22:21:36

How was it? Sorry I missed it, I was in a class (incident command system, Civil Air Patrol).


samdphillips
2021-2-6 23:10:24

Eli came and talked a bit about the development of the FFI. Dominik and I talked more about Raspberry Pi and FFI stuff.


jestarray
2021-2-7 07:52:24

drrackets debugger step button cant be spam clicked…. i have to unmouse, re-hover and then click… this is really annoying.. on racket cs 8.0 snapshot from a week ago or so but i think this problem has existed before then, unsure if its already reported or not