Skip to main content

  | मौसम…

411 समाचार
Public archive edition · Attributed source reporting with original dates · AI drafts are excluded

411 REFERENCE · Wikibooks

Ada Programming/Libraries/Ada.Containers.Bounded Hashed Maps

Reference material by Wikibooks contributors. This retains its source identity and is not 411 news reporting.

Ada.Containers.Bounded_Hashed_Maps __TOC__ Ada Containers Bounded_Hashed_Maps is a unit of the Predefined Language Environment since Ada 2012. Specification Standard Ada library specification 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 ------------------------------------------------------------------------- with Ada Iterator_Interfaces; generic type Key_Type is private; type Element_Type is private; with function Hash (Key : Key_Type) return Hash_Type; with function Equivalent_Keys (Left, Right : Key_Type) return Boolean; with function "=" (Left, Right : Element_Type) return Boolean is box <>; package Ada Containers Bounded_Hashed_Maps is pragma Preelaborate(Bounded_Hashed_Maps); pragma Remote_Types(Bounded_Hashed_Maps); type Map (Capacity : Count_Type; Modulus : Hash_Type) is tagged private with Constant_Indexing arrow => Constant_Reference, Variable_Indexing arrow => Reference, Default_Iterator arrow => Iterate, Iterator_Element arrow => Element_Type; pragma Preelaborable_Initialization(Map); type Cursor is private; pragma Preelaborable_Initialization(Cursor); Empty_Map : constant Map; No_Element : constant Cursor; function Has_Element (Position : Cursor) return Boolean; package Map_Iterator_Interfaces is new Adadot .Iterator_Interfaces (Cursor, Has_Element); function "=" (Left, Right : Map) return Boolean; function Capacity (Container : Map) return Count_Type; procedure Reserve_Capacity (Container : in out Map; Capacity : in Count_Type); function Default_Modulus (Capacity : Count_Type) return Hash_Type; function Length (Container : Map) return Count_Type; function Is_Empty (Container : Map) return Boolean; procedure Clear (Container : in out Map); function Key (Position : Cursor) return Key_Type; function Element (Position : Cursor) return Element_Type; procedure Replace_Element (Container : in out Map; Position : in Cursor; New_Item : in Element_Type); procedure Query_Element (Position : in Cursor; Process : not null access procedure (Key : in Key_Type; Element : in Element_Type)); procedure Update_Element (Container : in out Map; Position : in Cursor; Process : not null access procedure (Key : in Key_Type; Element : in out Element_Type)); type Constant_Reference_Type (Element : not null access constant Element_Type) is private with Implicit_Dereference arrow => Element; type Reference_Type (Element : not null access Element_Type) is private with Implicit_Dereference arrow => Element; function Constant_Reference (Container : aliased in Map; Position : in Cursor) return Constant_Reference_Type; function Reference (Container : aliased in out Map; Position : in Cursor) return Reference_Type; function Constant_Reference (Container : aliased in Map; Key : in Key_Type) return Constant_Reference_Type; function Reference (Container : aliased in out Map; Key : in Key_Type) return Reference_Type; procedure Assign (Target : in out Map; Source : in Map); function Copy (Source : Map; Capacity : Count_Type := 0; Modulus : Hash_Type := 0) return Map; procedure Move (Target : in out Map; Source : in out Map); procedure Insert (Container : in out Map; Key : in Key_Type; New_Item : in Element_Type; Position : out Cursor; Inserted : out Boolean); procedure Insert (Container : in out Map; Key : in Key_Type; Position : out Cursor; Inserted : out Boolean); procedure Insert (Container : in out Map; Key : in Key_Type; New_Item : in Element_Type); procedure Include (Container : in out Map; Key : in Key_Type; New_Item : in Element_Type); procedure Replace (Container : in out Map; Key : in Key_Type; New_Item : in Element_Type); procedure Exclude (Container : in out Map; Key : in Key_Type); procedure Delete (Container : in out Map; Key : in Key_Type); procedure Delete (Container : in out Map; Position : in out Cursor); function First (Container : Map) return Cursor; function Next (Position : Cursor) return Cursor; procedure Next (Position : in out Cursor); function Find (Container : Map; Key : Key_Type) return Cursor; function Element (Container : Map; Key : Key_Type) return Element_Type; function Contains (Container : Map; Key : Key_Type) return Boolean; function Equivalent_Keys (Left, Right : Cursor) return Boolean; function Equivalent_Keys (Left : Cursor; Right : Key_Type) return Boolean; function Equivalent_Keys (Left : Key_Type; Right : Cursor) return Boolean; procedure Iterate (Container : in Map; Process : not null access procedure (Position : in Cursor)); function Iterate (Container : in Map) return Map_Iterator_Interfacesdot .Forward_Iterator'Class; private not specified by the language end Adadot .Containersdot .Bounded_Hashed_Maps; See also Wikibook Ada Programming/Libraries/Ada Ada Programming/Libraries/Ada.Containers Ada Reference Manual Ada 2012 A 18 21 The Generic Package Containers.Bounded_Hashed_Maps Open-Source Implementations a-cbhama.ads a-cbhama.adb