ada/libgnat/a-chtgop.adb

50       Src_Buckets : constant Buckets_Access := HT.Buckets;
62       HT.Buckets := null;
77       HT.Buckets := New_Buckets (Length => Src_Buckets'Length);
91                HT.Buckets (Src_Index) := Dst_Node;
127       if HT.Buckets = null then
131       return HT.Buckets'Length;
140       Buckets    : Buckets_Type;
145       return Index (Buckets, Node);
153       return Checked_Index (Hash_Table, Hash_Table.Buckets.all, Node);
168          while HT.Buckets (Index) = null loop
173             Bucket : Node_Access renames HT.Buckets (Index);
199       Prev := HT.Buckets (Indx);
202          HT.Buckets (Indx) := Next (Prev);
253       Prev := HT.Buckets (Indx);
261          HT.Buckets (Indx) := Next (Prev);
296       Free_Buckets (HT.Buckets);
320       Position := HT.Buckets'First;
322          if HT.Buckets (Position) /= null then
323             return HT.Buckets (Position);
334    procedure Free_Buckets (Buckets : in out Buckets_Access) is
342       Free (Buckets_Allocation (Buckets));
349    procedure Free_Hash_Table (Buckets : in out Buckets_Access) is
353       if Buckets = null then
357       for J in Buckets'Range loop
358          while Buckets (J) /= null loop
359             Node := Buckets (J);
360             Buckets (J) := Next (Node);
365       Free_Buckets (Buckets);
400             L_Node := L.Buckets (L_Index);
429                   L_Node := L.Buckets (L_Index);
476       for Indx in HT.Buckets'Range loop
477          Node := HT.Buckets (Indx);
514       if HT.Buckets = null
515         or else HT.Buckets'Length < N
517          Free_Buckets (HT.Buckets);
519          HT.Buckets := New_Buckets (Length => NN);
526             B    : Node_Access renames HT.Buckets (Indx);
571      (Buckets : Buckets_Type;
574       return Hash_Node (Node) mod Buckets'Length;
581       return Index (Hash_Table.Buckets.all, Node);
599          Buckets : constant Buckets_Access := Target.Buckets;  constant
601          Target.Buckets := Source.Buckets;
602          Source.Buckets := Buckets;
652       for Indx in First .. HT.Buckets'Last loop
653          Result := HT.Buckets (Indx);
684       if HT.Buckets = null then
687             HT.Buckets := New_Buckets (Length => NN);
702             Free_Buckets (HT.Buckets);
706          if N = HT.Buckets'Length then
712          if NN = HT.Buckets'Length then
717             X : Buckets_Access := HT.Buckets;
720             HT.Buckets := New_Buckets (Length => NN);
727       if N = HT.Buckets'Length then
731       if N < HT.Buckets'Length then
738          if HT.Length >= HT.Buckets'Length then
744          if NN >= HT.Buckets'Length then
751          if NN = HT.Buckets'Length then -- can't expand any more
760          Src_Buckets : Buckets_Access := HT.Buckets;
831          HT.Buckets := Dst_Buckets;