chicken-users
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Chicken-users] New egg: hopefully


From: Jörg F . Wittenberger
Subject: Re: [Chicken-users] New egg: hopefully
Date: Fri, 18 Dec 2015 19:26:14 +0100
User-agent: Mozilla/5.0 (X11; Linux armv7l; rv:38.0) Gecko/20100101 Icedove/38.4.0

Am 18.12.2015 um 17:41 schrieb Sudarshan S Chawathe:
> 
> I cannot seem to access this egg.  'chicken-install' doesn't know about
> it (yet?) which didn't surprise me too much, but I also get HTTP 404
> errors when using the link to the source from the egg's doc page on
> call-cc.org (and ditto for the link on the askemos.org page):
> 
>   http://askemos.org/chicken-eggs/hopefully.tar.gz

Thanks for the report.  This link was wrong:

http://askemos.org/chicken-eggs/hopefully/hopefully.tar.gz

> 
> Is there some other place I should check?
> 
> Regards,
> 
> -chaw
> 
>> To: chicken-users <address@hidden>
>> From: Jörg F. Wittenberger <address@hidden>
>> Date: Thu, 17 Dec 2015 22:38:54 +0100
>> Subject: [Chicken-users] New egg: hopefully
>>
>> Hi,
>>
>> I just released the "hopefully" egg:  Composable transactional memory.
>>
>> API inspired by Clojure's ref's and STMX.
>>
>> Currently only some record types may be used with hopefully.  Further
>> versions should add other mutable types.
>>
>> I'd love to get feedback on the API.
>>
>> https://wiki.call-cc.org/eggref/4/hopefully
>>
>> Release-info and source is at
>> http://askemos.org/chicken-eggs/index.html
>> (this may be added the egg index).
>>
>> Best
>>
>> /Jörg
>>
>> BTW: STM is usually advertised because it frees the programmer from
>> getting locking sequences right.  However at least the "good", low level
>> API appears to here be marginally (~5-10%) faster than the equivalent
>> code using mutexs.
> 
> _______________________________________________
> Chicken-users mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/chicken-users
> 




reply via email to

[Prev in Thread] Current Thread [Next in Thread]