[m-dev.] [reuse] diff: implement sr_choice

[Fergus Henderson]

On 10-Oct-2000, Peter Ross <petdr at miscrit.be> wrote:
> sr_choice.m:
>     Given a set of canditates which are possible reusable select a
>     canditate randomly from those cells which already have the same cons_id.

It's spelt "candidates".

> +apply_constraint_unification(Constraint, Unif, GoalInfo0, GoalInfo) -->
> +	{ Unif = construct(_Var, ConsId, _Vars, _Ms, _HTC, _IsUniq, _Aditi) },
> +	{ goal_info_get_reuse(GoalInfo0, ReuseInfo) },
> +	{ ReuseInfo = choice(construct(Pairs)) ->
> +		PossibleCanditates = set__to_sorted_list(Pairs)

... likewise here in the code.

-- 
Fergus Henderson <fjh at cs.mu.oz.au>  |  "I have always known that the pursuit
WWW: <http://www.cs.mu.oz.au/~fjh>  |  of excellence is a lethal habit"
PGP: finger fjh at 128.250.37.3        |     -- the last words of T. S. Garp.
--------------------------------------------------------------------------
mercury-developers mailing list
Post messages to:       mercury-developers at cs.mu.oz.au
Administrative Queries: owner-mercury-developers at cs.mu.oz.au
Subscriptions:          mercury-developers-request at cs.mu.oz.au
--------------------------------------------------------------------------