Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Translations update from OSGeo Weblate #2650

Merged
merged 14 commits into from
Sep 23, 2024
Merged

Translations update from OSGeo Weblate #2650

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
14 commits
Select commit Hold shift + click to select a range
692e431
Update translation files
weblate Sep 23, 2024
28ac025
Translated using Weblate (Spanish)
cvvergara Sep 23, 2024
daacdd4
Update translation files
weblate Sep 23, 2024
ff55502
Translated using Weblate (Spanish)
Sep 23, 2024
256c128
Translated using Weblate (Spanish)
Sep 23, 2024
4937fe4
Translated using Weblate (Spanish)
cvvergara Sep 23, 2024
5a669e4
Translated using Weblate (Spanish)
cvvergara Sep 23, 2024
d1b3525
Translated using Weblate (Chinese (Simplified))
cvvergara Sep 23, 2024
6ef3713
Translated using Weblate (Chinese (Simplified))
cvvergara Sep 23, 2024
b83726d
Translated using Weblate (Chinese (Simplified))
Sep 23, 2024
0d7e081
Translated using Weblate (Chinese (Simplified))
cvvergara Sep 23, 2024
8573567
Translated using Weblate (Chinese (Simplified))
cvvergara Sep 23, 2024
6794735
Translated using Weblate (Chinese (Simplified))
cvvergara Sep 23, 2024
4554740
Translated using Weblate (Spanish)
cvvergara Sep 23, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
81 changes: 33 additions & 48 deletions locale/de/LC_MESSAGES/pgrouting_doc_strings.po
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,7 @@ msgid ""
msgstr ""
"Project-Id-Version: pgRouting v3.6.0-dev\n"
"Report-Msgid-Bugs-To: \n"
"POT-Creation-Date: 2024-08-16 18:52+0000\n"
"POT-Creation-Date: 2024-09-23 01:17+0000\n"
"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
"Last-Translator: Automatically generated\n"
"Language-Team: none\n"
Expand Down Expand Up @@ -2752,10 +2752,6 @@ msgid ""
"graph/doc/edge_coloring.html>`__"
msgstr ""

msgid ""
"`Wikipedia: Graph Coloring <https://en.wikipedia.org/wiki/Graph_coloring>`__"
msgstr ""

msgid "Components - Family of functions"
msgstr ""

Expand Down Expand Up @@ -4005,10 +4001,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"
Expand All @@ -4017,9 +4013,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 ""
Expand Down Expand Up @@ -6529,8 +6529,8 @@ 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."
"function's requirements. To simplify the variety of types, **ANY-INTEGER** "
"and **ANY-NUMERICAL** is used."
msgstr ""

msgid "Edges SQL for"
Expand Down Expand Up @@ -6957,9 +6957,6 @@ msgid ""
"pgrouting/releases/latest"
msgstr ""

msgid "wget"
msgstr ""

msgid "To download this release:"
msgstr ""

Expand Down Expand Up @@ -8069,8 +8066,7 @@ msgid "pgr_aStarCost"
msgstr ""

msgid ""
"``pgr_aStarCost`` - Total cost of the shortest path(s) using the A* "
"algorithm."
"``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm."
msgstr ""

msgid "``pgr_aStarCost`` (`Combinations`_)"
Expand All @@ -8080,7 +8076,7 @@ msgid "New **proposed** function"
msgstr ""

msgid ""
"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path(s) "
"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path "
"using the A* algorithm."
msgstr ""

Expand Down Expand Up @@ -8796,16 +8792,16 @@ 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 ""

msgid "``pgr_bdAstarCost`` (`Combinations`_)"
msgstr ""

msgid ""
"The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest "
"path(s) using the bidirectional A* algorithm."
"The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest path "
"using the bidirectional A* algorithm."
msgstr ""

msgid ""
Expand Down Expand Up @@ -8845,8 +8841,8 @@ msgid "``pgr_bdDijkstra``"
msgstr ""

msgid ""
"``pgr_bdDijkstra`` — Returns the shortest path(s) using Bidirectional "
"Dijkstra algorithm."
"``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra "
"algorithm."
msgstr ""

msgid "pgr_bdDijkstra(`Combinations`_)"
Expand Down Expand Up @@ -8886,7 +8882,7 @@ 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|"
Expand Down Expand Up @@ -8918,9 +8914,6 @@ msgid ""
"**undirected** graph"
msgstr ""

msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr ""

msgid "Using a combinations table on an **undirected** graph"
msgstr ""

Expand All @@ -8936,7 +8929,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 ""

Expand Down Expand Up @@ -8998,7 +8991,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:"
Expand Down Expand Up @@ -9172,9 +9165,6 @@ msgstr ""
msgid "``vid``"
msgstr ""

msgid "Identifier of the vertex"
msgstr ""

msgid "``centrality``"
msgstr ""

Expand Down Expand Up @@ -9255,7 +9245,7 @@ msgid "``pgr_binaryBreadthFirstSearch`` - Experimental"
msgstr ""

msgid ""
"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path(s) in a binary "
"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary "
"graph."
msgstr ""

Expand Down Expand Up @@ -10289,7 +10279,7 @@ msgid "pgr_dagShortestPath - Experimental"
msgstr ""

msgid ""
"``pgr_dagShortestPath`` — Returns the shortest path(s) for weighted directed "
"``pgr_dagShortestPath`` — Returns the shortest path for weighted directed "
"acyclic graphs(DAG). In particular, the DAG shortest paths algorithm "
"implemented by Boost.Graph."
msgstr ""
Expand Down Expand Up @@ -10561,7 +10551,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"
Expand Down Expand Up @@ -10797,16 +10787,16 @@ 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 ""

msgid "``pgr_dijkstraCost`` (`Combinations`_)"
msgstr ""

msgid ""
"The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest "
"path(s) using Dijkstra Algorithm."
"The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest path "
"using Dijkstra Algorithm."
msgstr ""

msgid ""
Expand Down Expand Up @@ -11196,7 +11186,7 @@ msgstr ""

msgid ""
"Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order "
"on an **directed** graph."
"on an directed graph."
msgstr ""

msgid "Via optional parameters"
Expand Down Expand Up @@ -13190,7 +13180,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 ""
Expand Down Expand Up @@ -14336,11 +14326,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."
Expand Down Expand Up @@ -14587,7 +14572,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:"
Expand Down Expand Up @@ -14932,7 +14917,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 points "
"aggregate cost of the shortest path found, for the combination of points "
"given."
msgstr ""

Expand All @@ -14941,7 +14926,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 ""
Expand Down
Loading
Loading