<> <> <> <> <> <> <> <> <<>> DIRECTORY Atom USING [PropList, DottedPair, DottedPairNode], Basics USING [Comparison]; List: CEDAR DEFINITIONS = BEGIN <<>> <> <> AList: TYPE = Atom.PropList; DottedPair: TYPE = Atom.DottedPair; DottedPairNode: TYPE = Atom.DottedPairNode; LORA: TYPE = LIST OF REF ANY; Comparison: TYPE = Basics.Comparison; CompareProc: TYPE = PROC[ref1: REF ANY, ref2: REF ANY] RETURNS [Comparison]; <> EqLists: PROC [l1, l2: LORA] RETURNS [BOOL]; <> <<>> Memb: PROC [ref: REF ANY, list: LORA] RETURNS[BOOL]; <> <> Append: PROC[l1: LORA, l2: LORA _ NIL] RETURNS[LORA]; <> <<>> Remove: PROC[ref: REF ANY, list: LORA] RETURNS[LORA]; <> <<>> Reverse: PROC [list: LORA] RETURNS[LORA]; <> << >> Union: PROC [l1, l2: LORA] RETURNS[LORA]; <> <<>> Intersection: PROC [l1, l2: LORA] RETURNS[LORA]; <> <<>> ListDifference: PROC [l1, l2: LORA] RETURNS[LORA]; <> <<>> LDiff: PROC [list, tailOfList: LORA] RETURNS[LORA]; <> <> Nconc: PROC [l1, l2: LORA] RETURNS[LORA]; <> <<>> Nconc1: PROC [list: LORA, ref: REF ANY] RETURNS[LORA]; <> <> <<>> DRemove: PROC [ref: REF ANY, list: LORA] RETURNS[LORA]; <> <<>> DReverse: PROC [list: LORA] RETURNS[LORA]; <> DSubst: PROC [new, old: REF ANY, expr: LORA] RETURNS[LORA]; <> <> NthTail: PROC[list: LORA, n: INT] RETURNS[LORA]; <> < Length[list].>> <<>> NthElement: PROC[list: LORA, n: INT] RETURNS[REF ANY]; <> <> <<>> <> Assoc: PROC [key: REF ANY, aList: AList] RETURNS[REF ANY]; <> DotCons: PROC [key, val: REF ANY] RETURNS [DottedPair]; <> <<(slightly slower, but generates less code)>> PutAssoc: PROC [key: REF ANY, val: REF ANY, aList: AList] RETURNS[AList]; <> <> Length: PROC [list: LORA] RETURNS[INT]; <> Map: PROC [list: LORA, proc: PROC[REF ANY, LORA]]; <> <> <> <> Subst: PROC [new, old: REF ANY, expr: LORA] RETURNS [LORA]; <> <> < RETURN [NIL];>> < RETURN [CONS[new, Subst[new, old, expr.rest]]];>> < RETURN [CONS[expr.first, Subst[new, old, expr.rest]]];>> <<>> Kill: PROC [list: LORA]; <> <> <> <> <> <> <> Sort: PROC [list: LORA, compareProc: CompareProc _ Compare] RETURNS[LORA]; <<... destructively sorts the given list in increasing order according to compareProc. The sort is not stable, so order of equal elements is not preserved.>> UniqueSort: PROC [list: LORA, compareProc: CompareProc _ Compare] RETURNS[LORA]; <<... is like Sort, but removes duplicates in a separate pass over the sorted list>> Merge: PROC [x,y: LORA, compareProc: CompareProc] RETURNS [LORA]; <<... destructively merges two lists according to compareProc. If the input lists are sorted in increasing order, then the output list will be sorted in increasing order.>> Compare: CompareProc; <<.. a general (although slow) CompareProc that can sort lists where all of the elements are the same type. Element types supported are ROPE, REF INT, or ATOM.>> <> NotATail: SIGNAL [list, tailOfList: LORA] RETURNS[LORA]; <> END.