X-Git-Url: https://pintos-os.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=src%2Flibpspp%2Fabt.h;h=e64ad289304d009d8119b38b162a46b2db66eed4;hb=f4810d3c8656b3b3ab26303d2dae70fc361db7fb;hp=f48e7a2ab8893c33e995d3f7f69ef965c3689a71;hpb=9683d7528884fcb3c60705812de9f96889536388;p=pspp-builds.git

diff --git a/src/libpspp/abt.h b/src/libpspp/abt.h
index f48e7a2a..e64ad289 100644
--- a/src/libpspp/abt.h
+++ b/src/libpspp/abt.h
@@ -61,7 +61,7 @@
    larger tree is rearranged, e.g. via a series of rotations,
    then the implementation will not call the reaugmentation
    function outside of the subtree, because the overall
-   augmentation data for the subtree is assumed not to changed.
+   augmentation data for the subtree is assumed not to change.
    This optimization is valid for the forms of augmentation
    described in CLR and Knuth (see below), and it is possible
    that it is valid for every efficient binary search tree
@@ -193,6 +193,10 @@ void abt_init (struct abt *, abt_compare_func *, abt_reaugment_func *,
                const void *aux);
 
 struct abt_node *abt_insert (struct abt *, struct abt_node *);
+void abt_insert_after (struct abt *,
+                       const struct abt_node *, struct abt_node *);
+void abt_insert_before (struct abt *,
+                        const struct abt_node *, struct abt_node *);
 void abt_delete (struct abt *, struct abt_node *);
 
 struct abt_node *abt_first (const struct abt *);