DIRECTORY Alloc USING [Handle], MobSymbols USING [HTIndex], MobTree USING [AttrId, Finger, Index, Info, Link, Map, NodeName, Scan]; MobTreeOps: DEFINITIONS = { Initialize: PROC[Alloc.Handle]; Reset, Finalize: PROC; PushTree: PROC[v: MobTree.Link]; PopTree: PROC RETURNS[MobTree.Link]; InsertTree: PROC[MobTree.Link, CARDINAL]; ExtractTree: PROC[CARDINAL] RETURNS[MobTree.Link]; MakeNode: PROC[name: MobTree.NodeName, count: INTEGER] RETURNS[MobTree.Link]; PushNode: PROC[name: MobTree.NodeName, count: INTEGER]; PushList: PROC[size: INTEGER]; PushHash: PROC[hti: MobSymbols.HTIndex]; SetAttr: PROC[attr: MobTree.AttrId, value: BOOL]; SetInfo: PROC[info: MobTree.Info]; FreeNode: PROC[node: MobTree.Index]; FreeTree: PROC[t: MobTree.Link] RETURNS[MobTree.Link]; GetNode: PROC[t: MobTree.Link] RETURNS[MobTree.Index]; MarkShared: PROC[t: MobTree.Link, shared: BOOL]; ScanSons: PROC[root: MobTree.Link, action: MobTree.Scan]; UpdateLeaves: PROC[root: MobTree.Link, map: MobTree.Map] RETURNS[v: MobTree.Link]; ListLength: PROC[t: MobTree.Link] RETURNS[CARDINAL]; ScanList: PROC[root: MobTree.Link, action: MobTree.Scan]; UpdateList: PROC[root: MobTree.Link, map: MobTree.Map] RETURNS[MobTree.Link]; NodeSize: PROC[baseP: MobTree.Finger, node: MobTree.Index] RETURNS[CARDINAL]; }. Ό MobTreeOps.mesa Copyright Σ 1985, 1989, 1991 by Xerox Corporation. All rights reserved. Satterthwaite, October 11, 1985 12:21:56 pm PDT Paul Rovner, September 7, 1983 12:14 am Russ Atkinson (RRA) March 6, 1985 10:06:59 pm PST Andy Litman March 4, 1988 7:51:26 pm PST JKF July 22, 1989 3:26:14 pm PDT tree construction interface tree deallocation tree attributes tree manipulation list testing list manipulation cross-table tree copying Κœ•NewlineDelimiter –(cedarcode) style™codešœ™Kšœ Οeœ=™HKšΟy/™/Kšž'™'Kšœ1™1Kšž(™(K™ —K˜šΟk ˜ KšœŸœ ˜Kšœ Ÿœ ˜KšœŸœ:˜GK˜—Kšœ Ÿ œ˜˜Kšœ™˜KšΟn œŸœ˜Kšœ œŸœ˜K˜Kš œŸœ˜ Kš œŸœŸœ˜$K˜Kš  œŸœŸœ˜)Kš  œŸœŸœŸœ˜2K˜Kš œŸœ ŸœŸœ˜MK˜Kš œŸœ Ÿœ˜7Kš œŸœŸœ˜Kš œŸœ˜(K˜Kš œŸœŸœ˜1Kš œŸœ˜"K˜—Kšœ™˜Kš œŸœ˜$Kš œŸœŸœ˜6K˜—Kšœ™˜Kš œŸœŸœ˜6Kš  œŸœŸœ˜0K˜—Kšœ™˜Kš œŸœ+˜9Kš  œŸœ'Ÿœ˜RK˜—Kšœ ™ ˜Kš  œŸœŸœŸœ˜4K˜—Kšœ™˜Kš œŸœ+˜9Kš  œŸœ'Ÿœ˜MK˜K˜—Kšœ™˜Kš œŸœ-ŸœŸœ˜MK˜K˜K˜———…— l