From e24ef9dc7d5e1e9d5189b3366bbc79b68fece5d2 Mon Sep 17 00:00:00 2001 From: "github-actions[bot]" <41898282+github-actions[bot]@users.noreply.github.com> Date: Mon, 23 Sep 2024 01:17:41 +0000 Subject: [PATCH] Update locale: commit 0b78b07099 --- .../en/LC_MESSAGES/pgrouting_doc_strings.po | 81 ++++++++----------- locale/pot/pgrouting_doc_strings.pot | 67 +++++++-------- 2 files changed, 62 insertions(+), 86 deletions(-) diff --git a/locale/en/LC_MESSAGES/pgrouting_doc_strings.po b/locale/en/LC_MESSAGES/pgrouting_doc_strings.po index 6cbbceff42..bd57f93000 100644 --- a/locale/en/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/en/LC_MESSAGES/pgrouting_doc_strings.po @@ -8,7 +8,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v3.6.0-dev\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2024-08-26 11:20+0000\n" +"POT-Creation-Date: 2024-09-23 01:17+0000\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" "Last-Translator: FULL NAME \n" "Language-Team: LANGUAGE \n" @@ -2757,11 +2757,6 @@ msgid "" "`__" msgstr "" -msgid "" -"`Wikipedia: Graph Coloring " -"`__" -msgstr "" - msgid "Components - Family of functions" msgstr "" @@ -4015,10 +4010,10 @@ msgid "" "returned." msgstr "" -msgid "There is no flow when a **source** is the same as a **target**." +msgid "There is no flow when source has the same vaule as target." msgstr "" -msgid "Any duplicated value in the source(s) or target(s) are ignored." +msgid "Any duplicated values in source or target are ignored." msgstr "" msgid "Calculates the flow/residual capacity for each edge. In the output" @@ -4027,9 +4022,13 @@ msgstr "" msgid "Edges with zero flow are omitted." msgstr "" -msgid "" -"Creates a **super source** and edges to all the source(s), and a **super " -"target** and the edges from all the targets(s)." +msgid "Creates" +msgstr "" + +msgid "a **super source** and edges from it to all the sources," +msgstr "" + +msgid "a **super target** and edges from it to all the targetss." msgstr "" msgid "" @@ -6555,7 +6554,7 @@ msgstr "" msgid "" "There are several kinds of valid inner queries and also the columns " "returned are depending of the function. Which kind of inner query will " -"depend on the function(s) requirements. To simplify variety of types, " +"depend on the function's requirements. To simplify the variety of types, " "**ANY-INTEGER** and **ANY-NUMERICAL** is used." msgstr "" @@ -6983,9 +6982,6 @@ msgid "" "https://github.com/pgRouting/pgrouting/releases/latest" msgstr "" -msgid "wget" -msgstr "" - msgid "To download this release:" msgstr "" @@ -8099,7 +8095,7 @@ msgid "pgr_aStarCost" msgstr "" msgid "" -"``pgr_aStarCost`` - Total cost of the shortest path(s) using the A* " +"``pgr_aStarCost`` - Total cost of the shortest path using the A* " "algorithm." msgstr "" @@ -8110,8 +8106,8 @@ msgid "New **proposed** function" msgstr "" msgid "" -"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest " -"path(s) using the A* algorithm." +"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path" +" using the A* algorithm." msgstr "" msgid "" @@ -8826,7 +8822,7 @@ msgid "pgr_bdAstarCost" msgstr "" msgid "" -"``pgr_bdAstarCost`` - Total cost of the shortest path(s) using the " +"``pgr_bdAstarCost`` - Total cost of the shortest path using the " "bidirectional A* algorithm." msgstr "" @@ -8835,7 +8831,7 @@ msgstr "" msgid "" "The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest " -"path(s) using the bidirectional A* algorithm." +"path using the bidirectional A* algorithm." msgstr "" msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" @@ -8871,7 +8867,7 @@ msgid "``pgr_bdDijkstra``" msgstr "" msgid "" -"``pgr_bdDijkstra`` — Returns the shortest path(s) using Bidirectional " +"``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional " "Dijkstra algorithm." msgstr "" @@ -8908,7 +8904,7 @@ msgstr "" msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_ , [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" msgid "Returns set of |old-generic-result|" @@ -8941,9 +8937,6 @@ msgid "" "**undirected** graph" msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "" - msgid "Using a combinations table on an **undirected** graph" msgstr "" @@ -8958,7 +8951,7 @@ msgid "``pgr_bdDijkstraCost``" msgstr "" msgid "" -"``pgr_bdDijkstraCost`` — Returns the shortest path(s)'s cost using " +"``pgr_bdDijkstraCost`` — Returns the shortest path's cost using " "Bidirectional Dijkstra algorithm." msgstr "" @@ -9023,7 +9016,7 @@ msgstr "" msgid "``pgr_bellmanFord - Experimental``" msgstr "" -msgid "``pgr_bellmanFord`` — Shortest path(s) using Bellman-Ford algorithm." +msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." msgstr "" msgid "New **experimental** signature:" @@ -9196,9 +9189,6 @@ msgstr "" msgid "``vid``" msgstr "" -msgid "Identifier of the vertex" -msgstr "" - msgid "``centrality``" msgstr "" @@ -9280,8 +9270,8 @@ msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "" msgid "" -"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path(s) in a " -"binary graph." +"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary " +"graph." msgstr "" msgid "" @@ -10320,9 +10310,9 @@ msgid "pgr_dagShortestPath - Experimental" msgstr "" msgid "" -"``pgr_dagShortestPath`` — Returns the shortest path(s) for weighted " -"directed acyclic graphs(DAG). In particular, the DAG shortest paths " -"algorithm implemented by Boost.Graph." +"``pgr_dagShortestPath`` — Returns the shortest path for weighted directed" +" acyclic graphs(DAG). In particular, the DAG shortest paths algorithm " +"implemented by Boost.Graph." msgstr "" msgid "pgr_dagShortestPath(Combinations)" @@ -10593,7 +10583,7 @@ msgstr "" msgid "``pgr_dijkstra``" msgstr "" -msgid "``pgr_dijkstra`` — Shortest path(s) using Dijkstra algorithm." +msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." msgstr "" msgid "Version 3.5.0" @@ -10831,7 +10821,7 @@ msgid "``pgr_dijkstraCost``" msgstr "" msgid "" -"``pgr_dijkstraCost`` - Total cost of the shortest path(s) using Dijkstra " +"``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra " "algorithm." msgstr "" @@ -10840,7 +10830,7 @@ msgstr "" msgid "" "The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest " -"path(s) using Dijkstra Algorithm." +"path using Dijkstra Algorithm." msgstr "" msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" @@ -11233,7 +11223,7 @@ msgstr "" msgid "" "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that " -"order on an **directed** graph." +"order on an directed graph." msgstr "" msgid "Via optional parameters" @@ -13226,7 +13216,7 @@ msgstr "" msgid "New **Proposed** function" msgstr "" -msgid "Calculates the maximum flow from the `source(s)` to the `target(s)`." +msgid "Calculates the maximum flow from the sources to the targets." msgstr "" msgid "" @@ -14383,11 +14373,6 @@ msgid "" "[**options**])" msgstr "" -msgid "" -"Find the route that visits the vertices :math:`\\{ 5, 1, 8\\}` in that " -"order on an directed graph." -msgstr "" - msgid "" "All this examples are about the route that visits the vertices " ":math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." @@ -14637,7 +14622,7 @@ msgstr "" msgid "" "Modify the graph to include points defined by points_sql. Using Dijkstra " -"algorithm, find the shortest path(s)" +"algorithm, find the shortest path" msgstr "" msgid "Characteristics:" @@ -14981,7 +14966,7 @@ msgstr "" msgid "" "``pgr_withPointsCost`` - Calculates the shortest path and returns only " -"the aggregate cost of the shortest path(s) found, for the combination of " +"the aggregate cost of the shortest path found, for the combination of " "points given." msgstr "" @@ -14990,7 +14975,7 @@ msgstr "" msgid "" "Modify the graph to include points defined by points_sql. Using Dijkstra " -"algorithm, return only the aggregate cost of the shortest path(s) found." +"algorithm, return only the aggregate cost of the shortest path found." msgstr "" msgid "" diff --git a/locale/pot/pgrouting_doc_strings.pot b/locale/pot/pgrouting_doc_strings.pot index fefd37ce29..c5423ab80a 100644 --- a/locale/pot/pgrouting_doc_strings.pot +++ b/locale/pot/pgrouting_doc_strings.pot @@ -8,7 +8,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v3.7.0-dev\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2024-08-26 11:20+0000\n" +"POT-Creation-Date: 2024-09-23 01:17+0000\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" "Last-Translator: FULL NAME \n" "Language-Team: LANGUAGE \n" @@ -2548,9 +2548,6 @@ msgstr "" msgid "`Boost: Edge Coloring Algorithm documentation `__" msgstr "" -msgid "`Wikipedia: Graph Coloring `__" -msgstr "" - msgid "Components - Family of functions" msgstr "" @@ -3616,10 +3613,10 @@ msgstr "" msgid "When the maximum flow is 0 then there is no flow and **EMPTY SET** is returned." msgstr "" -msgid "There is no flow when a **source** is the same as a **target**." +msgid "There is no flow when source has the same vaule as target." msgstr "" -msgid "Any duplicated value in the source(s) or target(s) are ignored." +msgid "Any duplicated values in source or target are ignored." msgstr "" msgid "Calculates the flow/residual capacity for each edge. In the output" @@ -3628,7 +3625,13 @@ msgstr "" msgid "Edges with zero flow are omitted." msgstr "" -msgid "Creates a **super source** and edges to all the source(s), and a **super target** and the edges from all the targets(s)." +msgid "Creates" +msgstr "" + +msgid "a **super source** and edges from it to all the sources," +msgstr "" + +msgid "a **super target** and edges from it to all the targetss." msgstr "" msgid "The maximum flow through the graph is guaranteed to be the value returned by :doc:`pgr_maxFlow ` when executed with the same parameters and can be calculated:" @@ -5764,7 +5767,7 @@ msgstr "" msgid "Needs a `Combinations SQL`_" msgstr "" -msgid "There are several kinds of valid inner queries and also the columns returned are depending of the function. Which kind of inner query will depend on the function(s) requirements. To simplify variety of types, **ANY-INTEGER** and **ANY-NUMERICAL** is used." +msgid "There are several kinds of valid inner queries and also the columns returned are depending of the function. Which kind of inner query will depend on the function's requirements. To simplify the variety of types, **ANY-INTEGER** and **ANY-NUMERICAL** is used." msgstr "" msgid "Edges SQL for" @@ -6130,9 +6133,6 @@ msgstr "" msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest" msgstr "" -msgid "wget" -msgstr "" - msgid "To download this release:" msgstr "" @@ -7084,7 +7084,7 @@ msgstr "" msgid "pgr_aStarCost" msgstr "" -msgid "``pgr_aStarCost`` - Total cost of the shortest path(s) using the A* algorithm." +msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." msgstr "" msgid "``pgr_aStarCost`` (`Combinations`_)" @@ -7093,7 +7093,7 @@ msgstr "" msgid "New **proposed** function" msgstr "" -msgid "The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path(s) using the A* algorithm." +msgid "The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path using the A* algorithm." msgstr "" msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`" @@ -7687,13 +7687,13 @@ msgstr "" msgid "pgr_bdAstarCost" msgstr "" -msgid "``pgr_bdAstarCost`` - Total cost of the shortest path(s) using the bidirectional A* algorithm." +msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." msgstr "" msgid "``pgr_bdAstarCost`` (`Combinations`_)" msgstr "" -msgid "The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest path(s) using the bidirectional A* algorithm." +msgid "The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest path using the bidirectional A* algorithm." msgstr "" msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" @@ -7726,7 +7726,7 @@ msgstr "" msgid "``pgr_bdDijkstra``" msgstr "" -msgid "``pgr_bdDijkstra`` — Returns the shortest path(s) using Bidirectional Dijkstra algorithm." +msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." msgstr "" msgid "pgr_bdDijkstra(`Combinations`_)" @@ -7762,7 +7762,7 @@ msgstr "" msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_ , [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" msgid "Returns set of |old-generic-result|" @@ -7789,9 +7789,6 @@ msgstr "" msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph" msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "" - msgid "Using a combinations table on an **undirected** graph" msgstr "" @@ -7804,7 +7801,7 @@ msgstr "" msgid "``pgr_bdDijkstraCost``" msgstr "" -msgid "``pgr_bdDijkstraCost`` — Returns the shortest path(s)'s cost using Bidirectional Dijkstra algorithm." +msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." msgstr "" msgid "``pgr_bdDijkstraCost`` (`Combinations`_)" @@ -7852,7 +7849,7 @@ msgstr "" msgid "``pgr_bellmanFord - Experimental``" msgstr "" -msgid "``pgr_bellmanFord`` — Shortest path(s) using Bellman-Ford algorithm." +msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." msgstr "" msgid "New **experimental** signature:" @@ -7987,9 +7984,6 @@ msgstr "" msgid "``vid``" msgstr "" -msgid "Identifier of the vertex" -msgstr "" - msgid "``centrality``" msgstr "" @@ -8056,7 +8050,7 @@ msgstr "" msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "" -msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path(s) in a binary graph." +msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph." msgstr "" msgid "Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative integer, is termed as a 'binary graph'." @@ -8899,7 +8893,7 @@ msgstr "" msgid "pgr_dagShortestPath - Experimental" msgstr "" -msgid "``pgr_dagShortestPath`` — Returns the shortest path(s) for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph." +msgid "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph." msgstr "" msgid "pgr_dagShortestPath(Combinations)" @@ -9118,7 +9112,7 @@ msgstr "" msgid "``pgr_dijkstra``" msgstr "" -msgid "``pgr_dijkstra`` — Shortest path(s) using Dijkstra algorithm." +msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." msgstr "" msgid "Version 3.5.0" @@ -9346,13 +9340,13 @@ msgstr "" msgid "``pgr_dijkstraCost``" msgstr "" -msgid "``pgr_dijkstraCost`` - Total cost of the shortest path(s) using Dijkstra algorithm." +msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." msgstr "" msgid "``pgr_dijkstraCost`` (`Combinations`_)" msgstr "" -msgid "The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest path(s) using Dijkstra Algorithm." +msgid "The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest path using Dijkstra Algorithm." msgstr "" msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" @@ -9673,7 +9667,7 @@ msgstr "" msgid "Returns set of |via-result|" msgstr "" -msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an **directed** graph." +msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph." msgstr "" msgid "Via optional parameters" @@ -11323,7 +11317,7 @@ msgstr "" msgid "New **Proposed** function" msgstr "" -msgid "Calculates the maximum flow from the `source(s)` to the `target(s)`." +msgid "Calculates the maximum flow from the sources to the targets." msgstr "" msgid "When the maximum flow is **0** then there is no flow and **0** is returned." @@ -12307,9 +12301,6 @@ msgstr "" msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" msgstr "" -msgid "Find the route that visits the vertices :math:`\\{ 5, 1, 8\\}` in that order on an directed graph." -msgstr "" - msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." msgstr "" @@ -12502,7 +12493,7 @@ msgstr "" msgid "``pgr_trsp_withPoints`` (`Combinations`_)" msgstr "" -msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, find the shortest path(s)" +msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, find the shortest path" msgstr "" msgid "Characteristics:" @@ -12781,13 +12772,13 @@ msgstr "" msgid "``pgr_withPointsCost`` - Proposed" msgstr "" -msgid "``pgr_withPointsCost`` - Calculates the shortest path and returns only the aggregate cost of the shortest path(s) found, for the combination of points given." +msgid "``pgr_withPointsCost`` - Calculates the shortest path and returns only the aggregate cost of the shortest path found, for the combination of points given." msgstr "" msgid "pgr_withPointsCost(Combinations)" msgstr "" -msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, return only the aggregate cost of the shortest path(s) found." +msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, return only the aggregate cost of the shortest path found." msgstr "" msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph."