[m-rev.] diff: cleanup library/rtree.m

[Zoltan Somogyi]

On 16-Oct-2006, Julien Fischer <juliensf at csse.unimelb.edu.au> wrote:
> -        % Tests whether two regions intersect.
> +        % Succeeds iff if two regions intersect.

s/iff if/iff/

> -        % Computes the "size" of a region.
> +        % Returns the "size" of a region.
>          % e.g. for a 2D box, the "size" is equivalent to area.

What about non-2d boxes?

> -        % Computes a bounding region that contains both input regions.
> -        % The resulting region should be as small as possible.
> +        % Returns a minimal bounding region that contains both
> +        % input regions.

Document the fact that the bounding region must also be a box, which affects
what is "minimal".

> -    % Check whether an rtree is empty.
> +    %  Succeeds iff the given rtree is empty.

s/%  S/% S/

I didn't look at the diff for the implementation, since I haven't read
Guttman's paper.

Zoltan.
--------------------------------------------------------------------------
mercury-reviews mailing list
Post messages to:       mercury-reviews at csse.unimelb.edu.au
Administrative Queries: owner-mercury-reviews at csse.unimelb.edu.au
Subscriptions:          mercury-reviews-request at csse.unimelb.edu.au
--------------------------------------------------------------------------