Article View: comp.lang.prolog
Article #211Re: ?: Efficient implementation of HASHING in PROLOG
From: P. Singleton
Date: Thu, 16 Apr 1992 14:09
Date: Thu, 16 Apr 1992 14:09
14 lines
1013 bytes
1013 bytes
From article <10280@goanna.cs.rmit.oz.au>, by ok@goanna.cs.rmit.oz.au (Richard A. O'Keefe):
>> foo(X,Y,Z) :- hash_term(X-Y,Hash), foo2(Hash,X,Y,Z).
> Note that the predicate SHOULD be called term_hash(Term, Hash);
> with the name hash_term/2 one expects the hash argument to precede
> the term argument.
And Quintus' copy_term/2 SHOULD be called term_copy :-)
----
__ __ Paul Singleton (Mr) JANET: paul@uk.ac.keele.cs
|__) (__ Computer Science Dept. other: paul@cs.keele.ac.uk
| . __). Keele University, Newcastle, tel: +44 (0)782 621111 x7355
Staffs ST5 5BG, ENGLAND fax: +44 (0)782 713082
Technical Details
Message-ID:
<2555@keele.keele.ac.uk>Path:
arc1-ca.pugleaf.net!sparky!uunet!mcsun!uknet!keele!csa09References:
<10280@goanna.cs.rmit.oz.au>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!uknet!keele!csa09 From: csa09@seq1.keele.ac.uk (P. Singleton) Newsgroups: comp.lang.prolog Subject: Re: ?: Efficient implementation of HASHING in PROLOG Message-ID: <2555@keele.keele.ac.uk> Date: 16 Apr 92 14:09:07 GMT References: <10280@goanna.cs.rmit.oz.au> Organization: University of Keele, England Lines: 14