--- ai05s/ai05-0212-1.txt 2011/03/17 07:06:30 1.11 +++ ai05s/ai05-0212-1.txt 2011/03/18 00:11:53 1.12 @@ -1,6 +1,7 @@ -!standard A.18.2(9/2) 11-03-16 AI05-0212-1/08 +!standard A.18.2(9/2) 11-03-17 AI05-0212-1/09 !standard A.18.33(0) !class Amendment 10-04-26 +!status ARG Approved 8-0-0 11-03-17 !status work item 10-04-26 !status received 10-02-27 !priority Medium @@ -368,7 +369,7 @@ Add a new clause at the end of the containers section: (Currently A.18.33) -A.18.33 Example of container use +A.18.33 Example of Container Use The following example is an implementation of Dijkstra's shortest path algorithm in a directed graph with positive distances. The graph is represented by a map from nodes @@ -400,7 +401,7 @@ function Shortest_Path (G : Graphs.Vector; Source : Node; Target : Node) return Paths.List with - Pre => G.ELement (Source) /= Adjacency_Lists.Empty_List; + Pre => G (Source) /= Adjacency_Lists.Empty_List; end Shortest_Paths; @@ -506,7 +507,7 @@ which is the same as: declare - L : Adjecency_Lists.List renames G (Next); + L : Adjacency_Lists.List renames G (Next); C : Adjacency_Lists.Cursor := L.First; begin while C /= No_Element loop

Questions? Ask the ACAA Technical Agent