POV-Ray : Newsgroups : povray.off-topic : Binary trees, branches and leaves : Re: Binary trees, branches and leaves Server Time
4 Sep 2024 09:15:28 EDT (-0400)
  Re: Binary trees, branches and leaves  
From: Darren New
Date: 4 Mar 2010 12:45:36
Message: <4b8ff1c0$1@news.povray.org>
Invisible wrote:
> More succinctly: In OO, trees are usually mutable. In Haskell, trees are 
> usually immutable.

Not that so much as identity is an important aspect of OO, where it isn't in 
functional programming. Two different objects with exactly the same value 
are nevertheless not interchangable.

> A bigger part of it is that, while essentially Haskell has pointers, 
> null pointers are explicitly prohibited.

You could always have Branch hold a couple of Maybe Leaf's.

-- 
Darren New, San Diego CA, USA (PST)
   The question in today's corporate environment is not
   so much "what color is your parachute?" as it is
   "what color is your nose?"


Post a reply to this message

Copyright 2003-2023 Persistence of Vision Raytracer Pty. Ltd.