úÎ3Q0‹     portable experimentalmihailbogojeski@gmail.com Safe-InferredJThe predicate class that can be instanced by the user to create new types  of balanced search trees ?Checks if the given entry is consistent with a given predicate UReturns a predicate that is the union of all predicates of the given list of entries WCalculates a numerical penalty for inserting the entry containing the first predicate C into a subtree rooted at an entry containing the second predicate \Given a list of entries, returns two disjunct subsets that contain the entries in the list. @ Focus is on minimising the overlap between the splitted entries' predicates +A node entry has a predicate and a subtree &A leaf entry has a predicate and data "A general entry type for the gist .The data structure used for building the GiST  a null GiST internal node  leaf node $Returns the predicate of this entry 'Comparison only based on the predicate   !   !    ! portable experimentalmihailbogojeski@gmail.com Safe-Inferred ISearches the GiST for leaf nodes that satisfy the given search predicate CInserts an entry into the tree, rebalancing the tree if necessary. D Rebalancing is done to satisfy the minimum and maximum fill factor / of the tree (represented as an integer tuple) HDeletes a leaf entry from the tree, rebalancing the tree if necessary. D Rebalancing is done to satisfy the minimum and maximum fill factor / of the tree (represented as an integer tuple) Create a new empty GiST Loads a GiST from file Saves the GiST to file "\A helper function that propagates insertion through the subtrees and splits when necessary. J If the node is overpopulated after the insertion, the node is split into > two smaller nodes which are then added to the parent &Returns all the data stored in a GiST &Return the number of values in a GiST  "#$%&'()     "#$%&'()portable experimentalmihailbogojeski@gmail.com Safe-Inferred#equality predicate (integer value) !containment predicate (interval) 'Tests if a value is between two others *@More documentation on the instance implementation in the source +,*+,*portable experimentalmihailbogojeski@gmail.com Safe-Inferred equality predicate (2D point) "containment predicate (rectangle) -6The lower limit for the x coordinate of the predicate .6The upper limit for the y coordinate of the predicate /6The upper limit for the x coordinate of the predicate 06The lower limit for the y coordinate of the predicate 1*Size of the area covered by the predicate 2GCalculates the greatest penalty between an entry and a list of entries l | Returns a tuple containing the greatest penalty and the two entries for which the penalty was calculated 3YImplementation of the linear split algorithm taking the minimal fill factor into account 4@More documentation on the instance implementation in the source 5-./01234 5-./012346        !"#$%&'()*+,-./0123456 GiST-0.0.1Data.GiST.GiSTData.GiST.BTreeData.GiST.RTreeData.GiST.Types Predicates consistentunionpenalty pickSplitPenalty NodeEntry LeafEntryEntryGiSTentryPredicatesearchinsertdeleteemptyloadsavegetDatasize PredicateEqualsContainsbetweenNullNodeLeaf $fOrdEntry unLeafEntry unNodeEntryinsertAndSplitdeleteAndCondenseinsertMultiple chooseSubtree minPenaltymakeRootisNull getEntries$fPredicatesPredicateIntminPmaxPminxPmaxyPmaxxPminyPareagreatestPenalty linearSplit$fPredicatesPredicate(,)overlaps