- Pharo-users - lists.pharo.org

Re: [Pharo-users] Morph layout changes in P4, P5 or P6

by Hilaire

Found, it is the Layout protocol. It seems to behave differently, at least: LayoutFrame fractions: fractionsOrNil offsets: offsetsOrNil does not behave the same Le 17/06/2017 Ã 18:40, Hilaire a Ã©crit : > I think the changes originated more likely in P4. -- Dr. Geo http://drgeo.eu

June 17, 2017

Re: [Pharo-users] Prolog in Pharo

by Evan Donahue

Hi, just saw this. Smallkanren is complete and under very active development, I just haven't put a new version up in a while because I didn't think that anyone was using it. I'm currently cleaning up a new release and was planning to upload that in the next few days. It should have full support for all the core functions and a better interface, in addition to being much faster. As far as the matter of real world vs academic exercise, I think I might say rather that it has not *yet* been as thoroughly developed and proven as prolog. It is, after all, a much newer language by almost a half century. However, it forms the basis of clojure's core.logic library, and has been seeing an increasing amount of deployment in real world projects in that area (configuration, parsing, test generation sorts of things I think). I'd like to enable the same in Pharo. If anyone is interested to know more, feel free to get in touch. Cheers, Evan -- View this message in context: http://forum.world.st/Prolog-in-Pharo-tp4951719p4951737.html Sent from the Pharo Smalltalk Users mailing list archive at Nabble.com.

June 17, 2017

Morph layout changes in P4, P5 or P6

by Hilaire

Hi, Any idea about what change(s) in P4/P5/P6 could cause this layout mess in DrGeo window? I think the changes originated more likely in P4. Thanks Hilaire -- Dr. Geo http://drgeo.eu

June 17, 2017

Re: [Pharo-users] Prolog in Pharo

by Stephane Ducasse

There is one in the goodies of St/X/ with an open-source license. On Sat, Jun 17, 2017 at 11:24 AM, Serge Stinckwich <serge.stinckwich(a)gmail.com> wrote: > Dear all, > > I'm looking for a simple Prolog engine available in Pharo compatible > with SWI-Prolog and with list support. Anything like that available ? > > Regards, > -- > Serge Stinckwich > UCN & UMI UMMISCO 209 (IRD/UPMC) > Every DSL ends up being Smalltalk > http://www.doesnotunderstand.org/ >

June 17, 2017

Re: [Pharo-users] UUIDGenerator

by Sven Van Caekenberghe

Why not just UUIDGenerator default next hex asUppercase. Or even UUID new hex asUppercase. ? Since you are using #generateBytes:forVersion: (which is an internal method BTW), you must be working in an older Pharo image (older than 6). We replaced the UUIDGenerator class, the class comment in from the newer version. > On 17 Jun 2017, at 16:27, horrido <horrido.hobbies(a)gmail.com> wrote: > > Okay, I figured it out. Here's my method: > > generateUUID > | aStream hex s x | > hex := '0123456789ABCDEF'. > x := ByteArray new: 16. > UUIDGenerator default generateBytes: x forVersion: 4. > s := String new: 32. > aStream := WriteStream on: s. > x do: [ :each | aStream nextPut: (hex at: each // 16 + 1). > aStream nextPut: (hex at: each \\ 16 + 1) ]. > ^ s > > Works like a charm. It would've been nice if a similar example was available > /somewhere/ on the web. > > > > -- > View this message in context: http://forum.world.st/UUIDGenerator-tp4951725p4951731.html > Sent from the Pharo Smalltalk Users mailing list archive at Nabble.com. >

June 17, 2017

Re: [Pharo-users] UUIDGenerator

by horrido

Okay, I figured it out. Here's my method: generateUUID | aStream hex s x | hex := '0123456789ABCDEF'. x := ByteArray new: 16. UUIDGenerator default generateBytes: x forVersion: 4. s := String new: 32. aStream := WriteStream on: s. x do: [ :each | aStream nextPut: (hex at: each // 16 + 1). aStream nextPut: (hex at: each \\ 16 + 1) ]. ^ s Works like a charm. It would've been nice if a similar example was available /somewhere/ on the web. -- View this message in context: http://forum.world.st/UUIDGenerator-tp4951725p4951731.html Sent from the Pharo Smalltalk Users mailing list archive at Nabble.com.

June 17, 2017

Re: [Pharo-users] UUIDGenerator

by Sven Van Caekenberghe

> On 17 Jun 2017, at 14:51, horrido <horrido.hobbies(a)gmail.com> wrote: > > Is there even one shred of documentation anywhere that shows how to use > UUIDGenerator? A thorough Google search reveals nothing! All I find are > reference materials. I'd like to see just one working code sample, no matter > how simple. Apart from the fact that it is a very simple class to use, what is wrong with the class comment ? ============ I am UUIDGenerator, I generate UUIDs. An RFC4122 Universally Unique Identifier (UUID) is an opaque 128-bit number that can be used for identification purposes. Concretely, a UUID is a 16 element byte array. The intent of UUIDs is to enable distributed systems to uniquely identify information without significant central coordination. In this context the word unique should be taken to mean "practically unique" rather than "guaranteed unique". I generate UUIDs similar, in spirit, to those defined in RFC4122, though I use version 0 to indicate that I follow none of the defined versions. This does not matter much, if at all, in practice. I try to conform to the following aspects: - each 'node' (machine, image, instance) should generate unique UUIDs - even when generating UUIDs at a very fast rate, they should remain unique - be fast and efficient To achieve this goal, I - take several aspects into account to generate a unique node ID - combine a clock, a counter and some random bits - hold a state, protected for multi user access I can generate about 500K UUIDs per second. Implementation: Although a UUID should be seen as totally opaque, here is the concrete way I generate one: - the first 8 bytes are the microsecond clock value with the smallest quantity first; this means that the later of these 8 bytes will be identical when generated with small(er) timespans; within the same clock resolution interval, the full first 8 bytes will be identical - the next 2 bytes represent a counter with safe overflow, held as protected state inside me; after 2*16 this value will repeat; the counter initalizes with a random value - the next 2 bytes are simply random, based on the system PRNG, Random - the final 4 bytes represent the node ID; the node ID is unique per instance of me, across OS environments where the image might run; the node ID is the MD5 hash of a string that is the concatenation of several elements (see #computeNodeIdentifier) Some bits are set to some predefined value, to indicate the variant and version (see #setVariantAndVersion:) Usage: UUIDGenerator next. UUIDGenerator current next. UUIDGenerator new next. Sharing an instance is more efficient and correct. Instances should be reset whenever the image comes up. See also: http://en.wikipedia.org/wiki/UUID https://tools.ietf.org/html/rfc4122 ===== Furthermore, all public methods are commented. Or do you have some specific question ? Sven

June 17, 2017

Re: [Pharo-users] UUIDGenerator

by Holger Freyther

> On 17. Jun 2017, at 20:51, horrido <horrido.hobbies(a)gmail.com> wrote: Hey! > > Is there even one shred of documentation anywhere that shows how to use > UUIDGenerator? A thorough Google search reveals nothing! All I find are > reference materials. I'd like to see just one working code sample, no matter > how simple. in these cases I use "Analyze->Class refs" on the class and it brings up the test case for the UUIDGenerator. Have a look at the >>#setUp and then the tests? have a nice weekend holger

June 17, 2017

UUIDGenerator

by horrido

Is there even one shred of documentation anywhere that shows how to use UUIDGenerator? A thorough Google search reveals nothing! All I find are reference materials. I'd like to see just one working code sample, no matter how simple. -- View this message in context: http://forum.world.st/UUIDGenerator-tp4951725.html Sent from the Pharo Smalltalk Users mailing list archive at Nabble.com.

June 17, 2017

Re: [Pharo-users] Prolog in Pharo

by Skip

Hello, Maybe not quite what you're looking for, but I know of two experiments with logic/relational programming in Pharo: - SmallKanren: http://smalltalkhub.com/#!/~EvanDonahue/SmallKanren/ - MicroKanren: http://smalltalkhub.com/#!/~adolfopa/MicroKanren/ Both are inspired/based on minikanren (http://minikanren.org/) which is an embedded DSL for logic programming with implementations in multiple languages. Both implementations above are incomplete, but of the two, I'd say SmallKanren is the most complete and most promising. Development seems a bit inactive, however. Minikanren in general seems to be more of an academic project than one with real-world application, which is a big downside. Best, Skip 2017-06-17 11:24 GMT+02:00 Serge Stinckwich <serge.stinckwich(a)gmail.com>: > Dear all, > > I'm looking for a simple Prolog engine available in Pharo compatible > with SWI-Prolog and with list support. Anything like that available ? > > Regards, > -- > Serge Stinckwich > UCN & UMI UMMISCO 209 (IRD/UPMC) > Every DSL ends up being Smalltalk > http://www.doesnotunderstand.org/ > >

June 17, 2017