From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,4b06f8f15f01a568 X-Google-Attributes: gid103376,public From: Matthew Heaney Subject: Re: Expressive Case Statements (was: Software landmines) Date: 1998/09/02 Message-ID: #1/1 X-Deja-AN: 387061901 Sender: matt@mheaney.ni.net References: <902934874.2099.0.nnrp-10.c246a717@news.demon.co.uk> <6r1glm$bvh$1@nnrp1.dejanews.com> <6r9f8h$jtm$1@nnrp1.dejanews.com> <6renh8$ga7$1@nnrp1.dejanews.com> <6rf59b$2ud$1@nnrp1.dejanews.com> <6rfra4$rul$1@nnrp1.dejanews.com> <35DBDD24.D003404D@calfp.co.uk> <6sbuod$fra$1@hirame.wwa.com> <35f51e53.48044143@ <904556531.666222@miso.it.uq.edu.au> <35EAEC47.164424A7@s054.aone.net.au> <6sgn8l$7aq$1@nnrp1.dejanews.com> <6sh487$lnq$1@nnrp1.dejanews.com> <6shit4$eaj@dfw-ixnews5.ix.netcom.com> <35ecc519.37879718@SantaClara01.news.InterNex.Net> NNTP-Posting-Date: Wed, 02 Sep 1998 01:14:51 PDT Newsgroups: comp.lang.ada Date: 1998-09-02T00:00:00+00:00 List-Id: tmoran@bix.com (Tom Moran) writes: > Are the conditions in such a decision table always boolean, or might > they be any enumerated type? They can be any enumerated type. For example, if color = (red, green, blue), and boolean = (true, false), and that's 6 combinations: color R R G G B B bool T F T F T F > Do you care if the compiler checks that you have branches for all > possibilities (as in a case statement, but not in an elsif list)? I find that it's better to consider all the _possible_ combinations, then prune away the ones that don't make sense. (See my other post for a decision table analysis of a loop predicate.)