Matthew Butterick writes:
> Once upon a time I tried to do the same for Pollen and couldn't sort it
> out. AFAICT the git hash isn't generated until the commit is made.
That's true; you can't figure out the hash before the commit is made.
I think I have the pieces of a workable (for me)
> On Jun 17, 2019, at 10:23 AM, Eric Eide wrote:
>
> Communicate with users. I want to put the appropriate git hash into the
> output
> of my program (Xsmith-based random program generators) so that I can attempt
> to
> reproduce the output, if necessary.
Once upon a time I tried to do the
But stepping back a little bit, I'm curious why you're doing this more
generally. Is this a way to communicate with users about what version
they are using somehow or to tell them how to get specific versions
that aren't the version listed on pkgs.racket-lang.org?
Robby
On Mon, Jun 17, 2019 at
On Mon, Jun 17, 2019 at 12:23 PM Eric Eide wrote:
>
> Robby Findler writes:
>
> > But stepping back a little bit, I'm curious why you're doing this more
> > generally. Is this a way to communicate with users about what version
> > they are using somehow or to tell them how to get specific
Robby Findler writes:
> But stepping back a little bit, I'm curious why you're doing this more
> generally. Is this a way to communicate with users about what version
> they are using somehow or to tell them how to get specific versions
> that aren't the version listed on pkgs.racket-lang.org?
Sam Tobin-Hochstadt writes:
> If you want "best-effort checksum associated with this code in some
> way" then combining the information from `pkg-info` with calling the
> git binary is probably necessary.
Yes, "best-effort checksum" is what I'm trying to do. Thanks again for the
help!
--
I guess I don't fully understand what you're trying to accomplish. In
general, a Racket package might live inside some git repository on the
file system, but Racket wouldn't necessarily know anything about that.
If you want "best-effort checksum associated with this code in some
way" then
On 6/17/19 4:20 PM, Robert Girault wrote:
I was able to do the first half of exercise 1 (see sources at the end
of this message) --- write a macro computing some information at
run-time. The second half is to write the same macro, but computing
some information at compile-time --- I couldn't do
I was able to do the first half of exercise 1 (see sources at the end
of this message) --- write a macro computing some information at
run-time. The second half is to write the same macro, but computing
some information at compile-time --- I couldn't do this one. I'm
looking for some directions
Call for Papers:
12th ACM SIGPLAN International Conference on Software Language Engineering
(SLE 2019)
co-located with SPLASH 2019
Athens, Greece
October 21-22, 2019
https://conf.researchr.org/home/sle-2019
10 matches
Mail list logo
