+&W      !"#$%&'()*+,-./0123456789:;<=> ? @ A B C D E F G H I J K L M N O P Q R S T U V  Safe%,-CFNQSTV]dh-?Type that can tell you about aggregate state of your structure.Segment of values in memory Segment of values somewhere elseSafe%,-CFNQSTV]dh"Structure with scattered segments.Safe%,-CFNQSTV]dhU'Put in-memory values to somewhere else. &Pull back segment of values to memory. LDo nothing with in-memory part, pull back all values of structure to memory. MKeep only a certain number of elements in memory, do something with the rest. HTraverse over scattered structure, including with all restored segments. (C) 2018 Murat Kasimov BSD-style (see the file LICENSE)%Murat Kasimov <iokasimov.m@gmail.com> experimental non-portableSafe%,-CFNQSTV]dh    Safe%,-CFNQSTV]dh Directed acyclic graph.#Remove vertex and all of its edges.    Safe%,-CFNQSTV]dhpOr non-empty list.Safe%,-CFNQSTV]dhInfinite sequence.Safe%,-CFNQSTV]dh  No children! Left child" Right child#Both%Get x from  Branches x y or from Less x.&Get y from  Branches x y or from  Greater y.)"The way to the most remote branch.*Balance factor for root node. # !"$%&'()* $ !"#%&'()* !"#Safe%,-CFNQSTV]dh4#Simple left (AVL), left zig (Splay)5%Simple right (AVL), right zig (Splay)6)Double right (AVL), right zig-zag (Splay)7'Double left (AVL), left zig-zag (Splay)8Left zig-zig (Splay)9Right zig-zig (Splay)3546789:3456789:3456789Safe%,-CFNQSTV]dh;(Trying rebalance tree after each insert.;;Safe%,-CFNQSTV]dh!<Splay tree after each insert.=3If needed element not in the root - it isn't found.<==< Safe%,-CFNQSTV]dh#BYou can insert value with path + 1 symbol of existing path in tree.>?@AB@>?AB>? Safe%,-CFNQSTV]dh$GHGH Safe%,-CFNQSTV]dh%[IJKLMNIJKLMNJKLMN Safe%,-CFNQSTV]dh&XOPQRTUSVOPQRSTUVPQRSTUVW    !"#$%&'()*+,-./01.2345*6789:;<=>?@ABCDEFG**H I J K L * M N O P Q R S T U V W X Y Z U V [ W X \]!apart-0.1.0-5167olSPGFmMeh9z7SAb8 Data.ApartData.Apart.Structures.GraphData.Apart.Structures.StackData.Apart.Structures.Stream!Data.Apart.Structures.Tree.Binary*Data.Apart.Structures.Tree.Binary.Rotation%Data.Apart.Structures.Tree.Binary.AVL'Data.Apart.Structures.Tree.Binary.Splay!Data.Apart.Structures.Tree.PrefixData.Apart.Structures.Tree.RoseData.Apart.Structures.Tree.T23Data.Apart.Structures.Tree.T234Data.Apart.ShapeData.Apart.ApartData.Apart.CombinatorsShapeReady Converted ScatteredSegmentApartpart MaterializerRestorerrecoverlimitfluentEdgeEmptySingleConnectOverlayGraphisolatedstarremove$fTraversableEdge$fFoldableEdge $fFunctorEdge $fShowEdgeStackinsertfoldawayStreamsameBranchesEndLessGreaterBinarylsgt singletonheightfactor$fTraversableBranches$fFoldableBranches$fFunctorBranches$fBindBranches $fAltBranches$fApplyBranches$fSemigroupBranches$fShowBranchesRotateLRLRRLLLRRrttsearchLabeledHopPrefixseek$fTraversableLabeled$fFoldableLabeled$fFunctorLabeled $fShowLabeledRose constructT23N23L2L3B2B3T234N234L4B4