Article View: comp.lang.prolog
Article #31Need merge predicate
From: Allen M. Theobald
Date: Sat, 31 Oct 1992 16:32
Date: Sat, 31 Oct 1992 16:32
20 lines
942 bytes
942 bytes
For all you guru prolog programmers out there... I need help defining a predicate merge1(L1,L2,L3) that is true whenever L3 can be obtained by merging the lists L1 and L2 such that there are no duplicates in L3 and all those members of L1 that are not in L2 appear in L3 before all the other members of L3. To put it another way L3 = L1 conc L2 such that there are no duplicates in L3. Most of the merge predicates defined do not remove duplicates! Any solutions and/or advice welcome... Thanks in advance! Please mail responses directly to me. Allen
Technical Details
Message-ID:
<Bwzv9u.Lso@ucunix.san.uc.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!elroy.jpl.nasa.gov!ames!pacbell.com!att-out!ucbeh.san.uc.edu!ucunix.san.uc.edu!theobaldShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!elroy.jpl.nasa.gov!ames!pacbell.com!att-out!ucbeh.san.uc.edu!ucunix.san.uc.edu!theobald Newsgroups: comp.lang.prolog Subject: Need merge predicate Message-ID: <Bwzv9u.Lso@ucunix.san.uc.edu> From: theobald@ucunix.san.uc.edu (Allen M. Theobald) Date: Sat, 31 Oct 1992 16:32:18 GMT Organization: University of Cincinnati Lines: 20