Ada 程式設計/庫/Ada.Containers.雙向連結串列

計算 » 計算機科學 » 計算機程式設計 » Ada 程式設計

---

此語言功能僅從 Ada 2005 開始提供。

Ada.Containers.Doubly_Linked_Lists 是自 Ada 2005 以來 預定義語言環境 的一個單元。

簡介

Ada 2005 的主要新增功能之一是 容器 庫。此庫使 Ada 開發人員能夠操縱資料結構，如雙向連結串列、對映、集合和向量。本頁面將展示 Ada.Containers.Doubly_Linked_Lists 庫的工作原理。

雙向連結串列只是一種連結串列，其中每個元素不僅連結到下一個元素，還連結到上一個元素。有關更多資訊，請參見 雙向連結串列。

示例

這是來自現有專案的示例用法。

worm.ads

此檔案表示蠕蟲的規範。

with Ada.Containers.Doubly_Linked_Lists;
with Wormlevel, Protocol; -- , Handlers;
 
package Worm is
  
  use Wormlevel, Protocol; -- , Handlers;
  
  package Worm_Position_Container is new Ada.Containers.Doubly_Linked_Lists(Position);
  use Worm_Position_Container;
  
  type Worm_State is (Alive,Dead,Observing);
 
  type Worm_Type is
     record
        Worm_Body : List;
        Direction : Course  := North;
        Points    : Natural := 0;
        Number    : Positive;
        State     : Worm_State := Alive;
        Full      : Boolean := False;
     end record;
  type Worm_Type_Access is access Worm_Type;
  procedure Update_Worm (Worm : in Worm_Type_Access;
                         Lvl  : in Level_Access);
  procedure Turn_Left   (Worm : in Worm_Type_Access);
  procedure Turn_Right  (Worm : in Worm_Type_Access);
  procedure Kill        (Worm : in Worm_Type_Access);
 
end Worm;

如您所見，Ada.Containers.Doubly_Linked_Lists 使用名為“Position”的型別例項化。此型別表示二維陣列中的瓦片型別。蠕蟲主體現在由雙向連結串列表示，這意味著我們可以使用 Next 和 Previous 函式，在任一方向遍歷每個元素。

對於有興趣的人來說，該遊戲可以在 GitHub 上找到。

規範

--                     Standard Ada library specification
--   Copyright (c) 2003-2018 Maxim Reznik <reznikmm@gmail.com>
--   Copyright (c) 2004-2016 AXE Consultants
--   Copyright (c) 2004, 2005, 2006 Ada-Europe
--   Copyright (c) 2000 The MITRE Corporation, Inc.
--   Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc.
--   SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual
-- -------------------------------------------------------------------------

generic
   type Element_Type is private;

   with function "=" (Left  : in Element_Type;
                      Right : in Element_Type)
                     return Boolean is <>;

package Ada.Containers.Doubly_Linked_Lists is

   pragma Preelaborate (Doubly_Linked_Lists);

   type List is tagged private;
   pragma Preelaborable_Initialization (List);

   type Cursor is private;
   pragma Preelaborable_Initialization (Cursor);

   Empty_List : constant List;

   No_Element : constant Cursor;

   function "=" (Left  : in List;
                 Right : in List)
                return Boolean;

   function Length (Container : in List) return Count_Type;

   function Is_Empty (Container : in List) return Boolean;

   procedure Clear (Container : in out List);

   function Element (Position : in Cursor) return Element_Type;

   procedure Replace_Element (Container : in out List;
                              Position  : in     Cursor;
                              New_Item  : in     Element_Type);

   procedure Query_Element
     (Position : in Cursor;
      Process  : not null access procedure (Element : in Element_Type));

   procedure Update_Element
     (Container : in out List;
      Position  : in     Cursor;
      Process   : not null access procedure (Element : in out Element_Type));

   procedure Move (Target : in out List;
                   Source : in out List);

   procedure Insert (Container : in out List;
                     Before    : in     Cursor;
                     New_Item  : in     Element_Type;
                     Count     : in     Count_Type := 1);

   procedure Insert (Container : in out List;
                     Before    : in     Cursor;
                     New_Item  : in     Element_Type;
                     Position  :    out Cursor;
                     Count     : in     Count_Type := 1);

   procedure Insert (Container : in out List;
                     Before    : in     Cursor;
                     Position  :    out Cursor;
                     Count     : in     Count_Type := 1);

   procedure Prepend (Container : in out List;
                      New_Item  : in     Element_Type;
                      Count     : in     Count_Type := 1);

   procedure Append (Container : in out List;
                     New_Item  : in     Element_Type;
                     Count     : in     Count_Type := 1);

   procedure Delete (Container : in out List;
                     Position  : in out Cursor;
                     Count     : in     Count_Type := 1);

   procedure Delete_First (Container : in out List;
                           Count     : in     Count_Type := 1);

   procedure Delete_Last (Container : in out List;
                          Count     : in     Count_Type := 1);

   procedure Reverse_Elements (Container : in out List);

   procedure Swap (Container : in out List;
                   I         : in     Cursor;
                   J         : in     Cursor);

   procedure Swap_Links (Container : in out List;
                         I         : in     Cursor;
                         J         : in     Cursor);

   procedure Splice (Target : in out List;
                     Before : in     Cursor;
                     Source : in out List);

   procedure Splice (Target   : in out List;
                     Before   : in     Cursor;
                     Source   : in out List;
                     Position : in out Cursor);

   procedure Splice (Container : in out List;
                     Before    : in     Cursor;
                     Position  : in     Cursor);

   function First (Container : in List) return Cursor;

   function First_Element (Container : in List) return Element_Type;

   function Last (Container : in List) return Cursor;

   function Last_Element (Container : in List) return Element_Type;

   function Next (Position : in Cursor) return Cursor;

   function Previous (Position : in Cursor) return Cursor;

   procedure Next (Position : in out Cursor);

   procedure Previous (Position : in out Cursor);

   function Find (Container : in List;
                  Item      : in Element_Type;
                  Position  : in Cursor := No_Element)
                 return Cursor;

   function Reverse_Find (Container : in List;
                          Item      : in Element_Type;
                          Position  : in Cursor := No_Element)
                         return Cursor;

   function Contains (Container : in List;
                      Item      : in Element_Type)
                     return Boolean;

   function Has_Element (Position : in Cursor) return Boolean;

   procedure Iterate
     (Container : in List;
      Process   : not null access procedure (Position : in Cursor));

   procedure Reverse_Iterate
     (Container : in List;
      Process   : not null access procedure (Position : in Cursor));

   generic
      with function "<" (Left  : in Element_Type;
                         Right : in Element_Type)
                        return Boolean is <>;

   package Generic_Sorting is

      function Is_Sorted (Container : in List) return Boolean;

      procedure Sort (Container : in out List);

      procedure Merge (Target : in out List;
                       Source : in out List);

   end Generic_Sorting;

private

   type List is tagged null record;

   Empty_List : constant List := (null record);

   type Cursor is null record;

   No_Element : constant Cursor := (null record);

end Ada.Containers.Doubly_Linked_Lists;

參見

華夏公益教科書

• Ada 程式設計/庫/Ada

外部示例

• 在以下位置搜尋 Ada.Containers.Doubly_Linked_Lists 的 示例： Rosetta Code、GitHub (gists)、任何 Alire 包 或 本華夏公益教科書。
• 在以下位置搜尋與 Ada.Containers.Doubly_Linked_Lists 相關的 帖子： Stack Overflow、comp.lang.ada 或 任何與 Ada 相關的頁面。

Ada 參考手冊

Ada 2005

• A.18.3: 包 Containers.Doubly_Linked_Lists ^[註釋]

Ada 2012

• A.18.3: 泛型包 Containers.Doubly_Linked_Lists ^[註釋]

開源實現

FSF GNAT

• 規範： a-cdlili.ads
• 主體： a-cdlili.adb

drake

• 規範： containers/a-cdlili.ads
• 主體： containers/a-cdlili.adb