package body Count_Tables is


    function Has_Element
           (Position : Cursor)
        return Boolean is
    begin
        return Position.My_Map /= null and then
            Position.Index >= Position.My_Map.My_Vec.First_Index and then
            Position.Index <= Position.My_Map.My_Vec.Last_Index;
    end Has_Element;


    function Key
           (Position : Cursor)
        return Key_Type is
    begin
        return Internal_Maps.Key
            (Position.My_Map.My_Vec.Element (Position.Index));
    end Key;


    function Element
           (Position : Cursor)
        return Natural is
    begin
        return Internal_Maps.Element
            (Position.My_Map.My_Vec.Element (Position.Index));
    end Element;


    function Reference
           (Container : aliased in out Map;
            Position  :                Cursor)
        return Reference_Type is
    begin
        return (Element => Container.My_Map.Reference
            (Container.My_Vec (Position.Index)).Element);
    end Reference;


    procedure Increment
           (Container : in out Map;
            Key       : in     Key_Type;
            Value     : in     Natural := 1)
    is
        Place   : Internal_Maps.Cursor;
        Success : Boolean;
    begin
        Container.My_Map.Insert (Key, Value, Place, Success);
        if not Success then
            Container.My_Map.Reference (Key) := Container.My_Map.Reference (Key) + Value;
        else
            Container.My_Vec.Append (Place);
        end if;
    end Increment;


    function Less
           (Left, Right : in Internal_Maps.Cursor)
        return Boolean is
    begin
        return Internal_Maps.Element (Right) < Internal_Maps.Element (Left);
    end Less;


    procedure Sort
           (Container : in out Map) is
    begin
        Cursor_Sorting.Sort (Container.My_Vec);
    end Sort;


    function Iterate
           (Container : in Map)
        return Map_Iterator_Interfaces.Reversible_Iterator'Class is
    begin
        return It : Iterator := (Ada.Finalization.Limited_Controlled
            with Container => Container'Unrestricted_Access);
    end Iterate;


    function First
           (Object : in Iterator) return Cursor is
    begin
        if Object.Container /= null and then
           not Object.Container.My_Map.Is_Empty
        then
            return (My_Map => Object.Container, Index => 1);
        else
            return No_Element;
        end if;
    end First;


    function Last
           (Object : in Iterator) return Cursor is
    begin
        if Object.Container /= null and then
           not Object.Container.My_Map.Is_Empty
        then
            return (My_Map => Object.Container, Index => Object.Container.My_Vec.Last_Index);
        else
            return No_Element;
        end if;
    end Last;


    function Next
           (Object   : in Iterator;
            Position : in Cursor) return Cursor is
    begin
        if Has_Element (Position) and then
           Position.Index < Position.My_Map.My_Vec.Last_Index
        then
            return (My_Map => Position.My_Map, Index => Position.Index + 1);
        else
            return No_Element;
        end if;
    end Next;


    function Previous
           (Object   : in Iterator;
            Position : in Cursor) return Cursor is
    begin
        if Has_Element (Position) and then
           Position.Index > Position.My_Map.My_Vec.First_Index
        then
            return (My_Map => Position.My_Map, Index => Position.Index - 1);
        else
            return No_Element;
        end if;
    end Previous;


end Count_Tables;