(* David Goldberg, goldberg@parc.xerox.com, 1992 *)

MODULE Tree;

PROCEDURE Equal (t, u: T): BOOLEAN =
  BEGIN
    <* ASSERT FALSE *>
    RETURN (t^ = u^);
  END Equal;

PROCEDURE Copy (t: T): T =
  VAR res: T;
  BEGIN
    <* ASSERT FALSE *>
    res := NEW(T);
    res^ := t^;
    RETURN (res);
  END Copy;

PROCEDURE Compare (<* UNUSED *>t, u: T): [-1 .. 1] =
  BEGIN
    <* ASSERT FALSE *>
    RETURN 0;
  END Compare;

PROCEDURE Hash (<* UNUSED *>t: T; <* UNUSED *>lessThan: CARDINAL): CARDINAL =
  BEGIN
    <* ASSERT FALSE *>
    RETURN 0;
  END Hash;

BEGIN
END Tree.