On Saturday, August 3, 2019 at 1:36:01 PM UTC+8, Jon Zeppieri wrote:
>
> On Sat, Aug 3, 2019 at 12:52 AM Jesse Wang > wrote:
> >
> > If I want to turn the hash code into array index in a hash table, do I
> need to
> > apply another uniform hash function such as
g N can be treated reasonably as a
> > constant." See. https://docs.racket-lang.org/reference/hashtables.html
> >
> > Justin
> >
> > On Fri, Aug 2, 2019 at 9:22 PM Jesse Wang > wrote:
> > >
> > > Racket allows different types of keys in a single
On Saturday, August 3, 2019 at 9:22:16 AM UTC+8, Jesse Wang wrote:
>
> Racket allows different types of keys in a single hash, so there must be a
> hash function that works for different types(different primitive types), I
> wonder how Racket implements this under the hood.
>
Racket allows different types of keys in a single hash, so there must be a
hash function that works for different types(different primitive types), I
wonder how Racket implements this under the hood.
Also, If I want to implement a hash table which allows different types of
keys, how can I implem
write to the port.
>
> (define/public (custom-display out)
> (displayln "custom-display" out))
> (define/public (custom-write out)
> (writeln "custom-write" out))
>
>
> On Sun, Jul 28, 2019 at 2:45 AM Jesse Wang > wrote:
>
>> H
Hi, I created a simple class to test the printable<%> interface:
(define my-class%
(class* object% (printable<%>)
(super-new)
(define/public (custom-display out)
(displayln "custom-display"))
(define/public (custom-write out)
(writeln "custom-write"))
(define/public (
6 matches
Mail list logo
