úÎ.E)C:      !"#$%&'()*+,-./01234567890:;<=>?@ABCDE Append two trees. O(n)1. Create a Tree from a finite list of elements. O(n)1. Create a Tree from a finite list of elements. MAfter the tree is created, it is balanced. This is useful with sorted data, < which would otherwise create a completely unbalanced tree. Is the tree empty? JSplit a tree at the point where the predicate on the measure changes from  False to True. Gfind the first point where the predicate returns True. Returns a tree $ splayed with that node at the top. -Like fmap, but with a more restrictive type. 1Like traverse, but with a more restrictive type. (descend to the deepest left-hand branch )descend to the deepest right-hand branch F"Descend a tree using the provided  descender descending function, G then recreate the tree. The new focus will be the last node accessed  in the tree. GHIJKLM@rebalance a splay tree. The order of elements does not change. N     OPQa RangeSet element  %A range of a single point (range =0) ! Create a Range from a minimum value and range " Create a Range from the two endpoints. #%check if a value is within the range $RS6create a range which encompasses both provided ranges T)subtract the second range from the first %&'()*+ !"#$%&'()*+ !"#$'&%)*+( !"#$%&'()*+,UVWXY ,,,-Z[\]^.Construct an empty set _&Construct a set with a single element /` if this set is empty, a otherwise. 0+Return the number of elements in this set. 1Return `, if the given value is present in this set, a otherwise. 2 Check if a* is a member, and return a set splayed to a. . The return set is splayed to an element near a if a isn' t in the  set. 3 Construct a Set from a list of elements. The Set is created by calling Data.SplayTree.fromListBalance. 4%Add the specified value to this set. 55Remove the specified value from this set if present. 68Construct a set containing all elements from both sets. <The smaller set should be presented as the second argument. 7:Transform this set by applying a function to every value. 8EDifference of two sets. Contains elements of the first set that are  not present in the second. 9CIntersection of two sets. Contains all elements which are in both  sets.  -./0123456789 -./0124568973 -./0123456789b      !!"#$%&'(  )*+ ,-.//01123456789:;<=>?@ABBCDEF*GHHI+JHHK LMNLMOP splaytree-0.1Data.SplayTreeData.SplayTree.RangeSetData.SplayTree.SeqData.SplayTree.Set SplayTreeBranchTipMeasuredMeasuremeasureempty singleton<||>><fromListfromListBalancenullsplitquerysize memberSplaydeleteinsert difference intersectionfmap' traverse'deepLdeepRbalanceRangeSetRangerMinrangpointrangerangePsinRangerangeMaxappendSeqSetmemberunionmapDepthgetDepthElemDgetElemDThreadDescRDescLleafbranchmyFoldldeepdescendLdescendRuprotateLrotateR ascendSplay ascendSplay'balance'RangeMNoRange compareRange combineMaxsubRangeunSeqElemgetElemunSetNoneghc-prim GHC.TypesTrueFalse