diff --git a/locale/de/LC_MESSAGES/pgrouting_doc_strings.po b/locale/de/LC_MESSAGES/pgrouting_doc_strings.po index 19236fa461d..1d9bfe24ae4 100644 --- a/locale/de/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/de/LC_MESSAGES/pgrouting_doc_strings.po @@ -6,7 +6,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2026-06-10 19:05+0000\n" +"POT-Creation-Date: 2026-08-08 21:44+0000\n" "PO-Revision-Date: 2025-09-22 16:28+0000\n" "Last-Translator: Anonymous \n" "Language-Team: German \n" @@ -338,6 +338,12 @@ msgstr "" msgid "Experimental" msgstr "" +msgid "Possible server crash" +msgstr "" + +msgid "These functions might create a server crash" +msgstr "" + msgid "Experimental functions" msgstr "" @@ -3563,6 +3569,9 @@ msgstr "" msgid "`#3113 `__: Components: Integrate into existing process/driver pair" msgstr "" +msgid "`#3129 `__: breadthFirstSearch: Reorganize into traversal" +msgstr "" + msgid "Bug Fixes" msgstr "" @@ -9491,6 +9500,12 @@ msgstr "``pgr_dijkstraVia``" msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "" +msgid "Version 4.0.2" +msgstr "" + +msgid "Fix: bad alloc" +msgstr "" + msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." msgstr "" @@ -9575,6 +9590,15 @@ msgstr "" msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "" +msgid "Standardizing negative distance behaviour" +msgstr "" + +msgid "Throws when :math:`distance < 0`." +msgstr "" + +msgid "Standard message and hint." +msgstr "" + msgid "pgr_drivingDistance(Single vertex)" msgstr "" @@ -12731,6 +12755,36 @@ msgstr "" msgid "pgRouting 4.0" msgstr "" +msgid "pgRouting 4.0.2 Release Notes" +msgstr "" + +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.2 `__" +msgstr "" + +msgid "4.0.2 Summary of changes by function" +msgstr "" + +msgid "pgr_dijkstraVia" +msgstr "pgr_dijkstraVia" + +msgid "pgr_drivingDistance" +msgstr "pgr_drivingDistance" + +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" + +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" + +msgid "4.0.2 Bug Fixes" +msgstr "" + +msgid "`#3110 `__: pgr_dijkstraVia throws std::bad_alloc when a node does not exist" +msgstr "" + +msgid "`#3091 `__: Catchment functions when negative distance do not have a standardized behaviour" +msgstr "" + msgid "pgRouting 4.0.1 Release Notes" msgstr "" @@ -12914,9 +12968,6 @@ msgstr "pgr_dijkstraNear" msgid "pgr_dijkstraNearCost" msgstr "pgr_dijkstraNearCost" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" - msgid "pgr_edgeDisjointPaths" msgstr "pgr_edgeDisjointPaths" @@ -12983,15 +13034,9 @@ msgstr "pgr_withPointsCost" msgid "pgr_withPointsCostMatrix" msgstr "pgr_withPointsCostMatrix" -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" - msgid "pgr_withPointsKSP" msgstr "pgr_withPointsKSP" -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" - msgid "Functions promoted to official" msgstr "" @@ -14792,9 +14837,6 @@ msgstr "pgr_alphashape" msgid "pgr_dijkstraCostMatrix" msgstr "pgr_dijkstraCostMatrix" -msgid "pgr_drivingDistance" -msgstr "pgr_drivingDistance" - msgid "pgr_dijkstraVia (proposed)" msgstr "" diff --git a/locale/en/LC_MESSAGES/pgrouting_doc_strings.po b/locale/en/LC_MESSAGES/pgrouting_doc_strings.po index e8a867aa925..205d6547301 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 v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2026-08-08 21:44+0000\n" +"POT-Creation-Date: 2026-08-10 15:43+0000\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" "Last-Translator: FULL NAME \n" "Language-Team: LANGUAGE \n" @@ -3992,6 +3992,11 @@ msgid "" "breadthFirstSearch: Reorganize into traversal" msgstr "" +msgid "" +"`#3131 `__: " +"binaryBreadthFirstSearch: Integrate into existing process/driver pair" +msgstr "" + msgid "Bug Fixes" msgstr "" diff --git a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po index 01288baec9f..38828bd34ae 100644 --- a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po @@ -10,7 +10,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2026-06-10 19:05+0000\n" +"POT-Creation-Date: 2026-08-08 21:44+0000\n" "PO-Revision-Date: 2025-12-10 20:25+0000\n" "Last-Translator: DeepL \n" "Language-Team: Spanish \n" @@ -343,6 +343,12 @@ msgstr ":doc:`pgr_trspVia_withPoints` - Ruteo Vía Punto/Vértice con restriccio msgid "Experimental" msgstr "Experimental" +msgid "Possible server crash" +msgstr "" + +msgid "These functions might create a server crash" +msgstr "" + msgid "Experimental functions" msgstr "Funciones experimentales" @@ -3581,6 +3587,10 @@ msgstr "`#2954 `__: pgr_king msgid "`#3113 `__: Components: Integrate into existing process/driver pair" msgstr "`#2954 `__: pgr_kingOrdering" +#, fuzzy +msgid "`#3129 `__: breadthFirstSearch: Reorganize into traversal" +msgstr "`#2931 `__: pgr_breadthFirstSearch" + msgid "Bug Fixes" msgstr "Corrección de errores" @@ -9521,6 +9531,13 @@ msgstr "``pgr_dijkstraVia``" msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "``pgr_dijkstraVia`` - Ruta que recorre una lista de vértices." +#, fuzzy +msgid "Version 4.0.2" +msgstr "Versión 4.0.0" + +msgid "Fix: bad alloc" +msgstr "" + msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." msgstr "Dada una lista de vértices y un grafo, esta función equivale a encontrar el camino más corto entre :math:`vértice_i` y :math:`vértice_{i+1}` para todo :math:`i < tamaño\\_de(vía\\;vértices)`." @@ -9605,6 +9622,15 @@ msgstr ":doc:`dijkstra-family`." msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "``pgr_drivingDistance`` - Devuelve la distancia de manejo desde un nodo de inicio." +msgid "Standardizing negative distance behaviour" +msgstr "" + +msgid "Throws when :math:`distance < 0`." +msgstr "" + +msgid "Standard message and hint." +msgstr "" + msgid "pgr_drivingDistance(Single vertex)" msgstr "pgr_drivingDistance(Vértice único)" @@ -12855,6 +12881,41 @@ msgstr "pgRouting 4.0" msgid "pgRouting 4.0" msgstr "pgRouting 4.0" +#, fuzzy +msgid "pgRouting 4.0.2 Release Notes" +msgstr "Notas de la versión 3.0.1 de pgRouting" + +#, fuzzy +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.2 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `Github milestone for 4.0.0 `__" + +msgid "4.0.2 Summary of changes by function" +msgstr "" + +msgid "pgr_dijkstraVia" +msgstr "pgr_dijkstraVia" + +msgid "pgr_drivingDistance" +msgstr "pgr_drivingDistance" + +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" + +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" + +#, fuzzy +msgid "4.0.2 Bug Fixes" +msgstr "Corrección de errores" + +#, fuzzy +msgid "`#3110 `__: pgr_dijkstraVia throws std::bad_alloc when a node does not exist" +msgstr "`#1640 `__: pgr_withPoints falla cuando points_sql está vacía" + +#, fuzzy +msgid "`#3091 `__: Catchment functions when negative distance do not have a standardized behaviour" +msgstr "`#2954 `__: pgr_kingOrdering" + #, fuzzy msgid "pgRouting 4.0.1 Release Notes" msgstr "Notas de la versión 3.0.1 de pgRouting" @@ -13052,9 +13113,6 @@ msgstr "pgr_dijkstraNear" msgid "pgr_dijkstraNearCost" msgstr "pgr_dijkstraNearCost" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" - msgid "pgr_edgeDisjointPaths" msgstr "pgr_edgeDisjointPaths" @@ -13121,15 +13179,9 @@ msgstr "pgr_withPointsCost" msgid "pgr_withPointsCostMatrix" msgstr "pgr_withPointsCostMatrix" -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" - msgid "pgr_withPointsKSP" msgstr "pgr_withPointsKSP" -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" - msgid "Functions promoted to official" msgstr "Funciones promovidas a oficial" @@ -15025,9 +15077,6 @@ msgstr "pgr_alphashape" msgid "pgr_dijkstraCostMatrix" msgstr "pgr_dijkstraCostMatrix" -msgid "pgr_drivingDistance" -msgstr "pgr_drivingDistance" - msgid "pgr_dijkstraVia (proposed)" msgstr "pgr_dijkstraVia (proposed)" diff --git a/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po b/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po index 84c7a7a5573..a8fe6b243a2 100644 --- a/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po @@ -22,7 +22,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2026-06-10 19:05+0000\n" +"POT-Creation-Date: 2026-08-08 21:44+0000\n" "PO-Revision-Date: 2026-06-10 16:05+0000\n" "Last-Translator: Teramoto Ikuhiro \n" "Language-Team: Japanese \n" @@ -362,6 +362,12 @@ msgstr ":doc:`pgr_trspVia_withPoints` - 制約付き頂点/ポイントのルー msgid "Experimental" msgstr "実験段階" +msgid "Possible server crash" +msgstr "" + +msgid "These functions might create a server crash" +msgstr "" + msgid "Experimental functions" msgstr "実験段階関数" @@ -3630,6 +3636,9 @@ msgstr "" msgid "`#3113 `__: Components: Integrate into existing process/driver pair" msgstr "" +msgid "`#3129 `__: breadthFirstSearch: Reorganize into traversal" +msgstr "" + msgid "Bug Fixes" msgstr "" @@ -9746,6 +9755,13 @@ msgstr "``pgr_dijkstraVia``" msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "" +#, fuzzy +msgid "Version 4.0.2" +msgstr "バージョン 2.0.0" + +msgid "Fix: bad alloc" +msgstr "" + msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." msgstr "" @@ -9830,6 +9846,15 @@ msgstr "" msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "" +msgid "Standardizing negative distance behaviour" +msgstr "" + +msgid "Throws when :math:`distance < 0`." +msgstr "" + +msgid "Standard message and hint." +msgstr "" + msgid "pgr_drivingDistance(Single vertex)" msgstr "" @@ -13045,6 +13070,36 @@ msgstr "" msgid "pgRouting 4.0" msgstr "" +msgid "pgRouting 4.0.2 Release Notes" +msgstr "" + +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.2 `__" +msgstr "" + +msgid "4.0.2 Summary of changes by function" +msgstr "" + +msgid "pgr_dijkstraVia" +msgstr "pgr_dijkstraVia" + +msgid "pgr_drivingDistance" +msgstr "pgr_drivingDistance" + +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" + +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" + +msgid "4.0.2 Bug Fixes" +msgstr "" + +msgid "`#3110 `__: pgr_dijkstraVia throws std::bad_alloc when a node does not exist" +msgstr "" + +msgid "`#3091 `__: Catchment functions when negative distance do not have a standardized behaviour" +msgstr "" + msgid "pgRouting 4.0.1 Release Notes" msgstr "" @@ -13231,9 +13286,6 @@ msgstr "pgr_dijkstraNear" msgid "pgr_dijkstraNearCost" msgstr "pgr_dijkstraNearCost" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" - msgid "pgr_edgeDisjointPaths" msgstr "pgr_edgeDisjointPaths" @@ -13300,15 +13352,9 @@ msgstr "pgr_withPointsCost" msgid "pgr_withPointsCostMatrix" msgstr "pgr_withPointsCostMatrix" -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" - msgid "pgr_withPointsKSP" msgstr "pgr_withPointsKSP" -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" - msgid "Functions promoted to official" msgstr "" @@ -15124,9 +15170,6 @@ msgstr "pgr_alphashape" msgid "pgr_dijkstraCostMatrix" msgstr "pgr_dijkstraCostMatrix" -msgid "pgr_drivingDistance" -msgstr "pgr_drivingDistance" - msgid "pgr_dijkstraVia (proposed)" msgstr "" diff --git a/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po b/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po index 7a49cd0b4b5..3eaea884f73 100644 --- a/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po @@ -7,7 +7,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2026-06-10 19:05+0000\n" +"POT-Creation-Date: 2026-08-08 21:44+0000\n" "PO-Revision-Date: 2025-09-22 16:28+0000\n" "Last-Translator: Hyung-Gyu Ryoo \n" "Language-Team: Korean \n" @@ -343,6 +343,12 @@ msgstr "" msgid "Experimental" msgstr ":doc:`experimental`" +msgid "Possible server crash" +msgstr "" + +msgid "These functions might create a server crash" +msgstr "" + msgid "Experimental functions" msgstr "" @@ -3581,6 +3587,9 @@ msgstr "" msgid "`#3113 `__: Components: Integrate into existing process/driver pair" msgstr "" +msgid "`#3129 `__: breadthFirstSearch: Reorganize into traversal" +msgstr "" + msgid "Bug Fixes" msgstr "" @@ -9669,6 +9678,13 @@ msgstr "``pgr_dijkstraVia``" msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "" +#, fuzzy +msgid "Version 4.0.2" +msgstr "짧은 버전" + +msgid "Fix: bad alloc" +msgstr "" + msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." msgstr "" @@ -9753,6 +9769,15 @@ msgstr "" msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "" +msgid "Standardizing negative distance behaviour" +msgstr "" + +msgid "Throws when :math:`distance < 0`." +msgstr "" + +msgid "Standard message and hint." +msgstr "" + #, fuzzy msgid "pgr_drivingDistance(Single vertex)" msgstr ":doc:`pgr_drivingDistance`" @@ -12943,6 +12968,36 @@ msgstr "" msgid "pgRouting 4.0" msgstr "" +msgid "pgRouting 4.0.2 Release Notes" +msgstr "" + +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.2 `__" +msgstr "" + +msgid "4.0.2 Summary of changes by function" +msgstr "" + +msgid "pgr_dijkstraVia" +msgstr "pgr_dijkstraVia" + +msgid "pgr_drivingDistance" +msgstr "pgr_drivingDistance" + +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" + +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" + +msgid "4.0.2 Bug Fixes" +msgstr "" + +msgid "`#3110 `__: pgr_dijkstraVia throws std::bad_alloc when a node does not exist" +msgstr "" + +msgid "`#3091 `__: Catchment functions when negative distance do not have a standardized behaviour" +msgstr "" + msgid "pgRouting 4.0.1 Release Notes" msgstr "" @@ -13127,9 +13182,6 @@ msgstr "pgr_dijkstraNear" msgid "pgr_dijkstraNearCost" msgstr "pgr_dijkstraNearCost" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" - msgid "pgr_edgeDisjointPaths" msgstr "pgr_edgeDisjointPaths" @@ -13198,15 +13250,9 @@ msgstr "pgr_withPointsCost" msgid "pgr_withPointsCostMatrix" msgstr "pgr_withPointsCostMatrix" -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" - msgid "pgr_withPointsKSP" msgstr "pgr_withPointsKSP" -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" - msgid "Functions promoted to official" msgstr "" @@ -15065,9 +15111,6 @@ msgstr "pgr_alphashape" msgid "pgr_dijkstraCostMatrix" msgstr "pgr_dijkstraCostMatrix" -msgid "pgr_drivingDistance" -msgstr "pgr_drivingDistance" - msgid "pgr_dijkstraVia (proposed)" msgstr "" diff --git a/locale/pot/pgrouting_doc_strings.pot b/locale/pot/pgrouting_doc_strings.pot index 251bca6dd9b..6b818a8187b 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 v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2026-08-08 21:44+0000\n" +"POT-Creation-Date: 2026-08-10 15:43+0000\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" "Last-Translator: FULL NAME \n" "Language-Team: LANGUAGE \n" @@ -3571,6 +3571,9 @@ msgstr "" msgid "`#3129 `__: breadthFirstSearch: Reorganize into traversal" msgstr "" +msgid "`#3131 `__: binaryBreadthFirstSearch: Integrate into existing process/driver pair" +msgstr "" + msgid "Bug Fixes" msgstr "" diff --git a/locale/sv/LC_MESSAGES/pgrouting_doc_strings.po b/locale/sv/LC_MESSAGES/pgrouting_doc_strings.po index 2cc6d5a23e0..75b8e9cdafa 100644 --- a/locale/sv/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/sv/LC_MESSAGES/pgrouting_doc_strings.po @@ -7,7 +7,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2026-06-10 19:05+0000\n" +"POT-Creation-Date: 2026-08-08 21:44+0000\n" "PO-Revision-Date: 2025-12-08 08:47+0000\n" "Last-Translator: Daniel Nylander \n" "Language-Team: Swedish \n" @@ -339,6 +339,12 @@ msgstr ":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictio msgid "Experimental" msgstr "Experiment" +msgid "Possible server crash" +msgstr "Möjlig serverkrasch" + +msgid "These functions might create a server crash" +msgstr "Dessa funktioner kan orsaka en serverkrasch" + msgid "Experimental functions" msgstr "Experimentella funktioner" @@ -3575,6 +3581,10 @@ msgstr "`#3025 `__: Ordnings msgid "`#3113 `__: Components: Integrate into existing process/driver pair" msgstr "`#3025 `__: Ordningsfunktioner standardiserade" +#, fuzzy +msgid "`#3129 `__: breadthFirstSearch: Reorganize into traversal" +msgstr "`#2931 `__: pgr_breadthFirstSearch" + msgid "Bug Fixes" msgstr "Buggfixar" @@ -9505,6 +9515,13 @@ msgstr "``pgr_dijkstraVia``" msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "``pgr_dijkstraVia`` - Rutt som går genom en lista med toppar." +#, fuzzy +msgid "Version 4.0.2" +msgstr "Version 4.0.0" + +msgid "Fix: bad alloc" +msgstr "" + msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." msgstr "Med en lista över hörnpunkter och en graf är denna funktion likvärdig med att hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` för alla :math:`i < size\\_of(via\\;hörnpunkter)`." @@ -9589,6 +9606,15 @@ msgstr ":doc:`dijkstra-family`." msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "``pgr_drivingDistance`` - Returnerar köravståndet från en startnod." +msgid "Standardizing negative distance behaviour" +msgstr "" + +msgid "Throws when :math:`distance < 0`." +msgstr "" + +msgid "Standard message and hint." +msgstr "" + msgid "pgr_drivingDistance(Single vertex)" msgstr "pgr_drivingDistance(Single vertex)" @@ -12746,6 +12772,42 @@ msgstr "pgRouting 4.1" msgid "pgRouting 4.0" msgstr "pgRouting 4.0" +#, fuzzy +msgid "pgRouting 4.0.2 Release Notes" +msgstr "Versionsinformation för pgRouting 3.0.1" + +#, fuzzy +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.2 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 4.0.0 `__" + +#, fuzzy +msgid "4.0.2 Summary of changes by function" +msgstr "Sammanfattning av förändringar per funktion" + +msgid "pgr_dijkstraVia" +msgstr "pgr_dijkstraVia" + +msgid "pgr_drivingDistance" +msgstr "pgr_drivingDistance" + +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" + +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" + +#, fuzzy +msgid "4.0.2 Bug Fixes" +msgstr "Buggfixar" + +#, fuzzy +msgid "`#3110 `__: pgr_dijkstraVia throws std::bad_alloc when a node does not exist" +msgstr "`#1640 `__: pgr_withPoints misslyckas när points_sql är tom" + +#, fuzzy +msgid "`#3091 `__: Catchment functions when negative distance do not have a standardized behaviour" +msgstr "`#3025 `__: Ordningsfunktioner standardiserade" + #, fuzzy msgid "pgRouting 4.0.1 Release Notes" msgstr "Versionsinformation för pgRouting 3.0.1" @@ -12941,9 +13003,6 @@ msgstr "pgr_dijkstraNear" msgid "pgr_dijkstraNearCost" msgstr "pgr_dijkstraNearCost" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" - msgid "pgr_edgeDisjointPaths" msgstr "pgr_edgeDisjointPaths" @@ -13010,15 +13069,9 @@ msgstr "pgr_withPointsCost" msgid "pgr_withPointsCostMatrix" msgstr "pgr_withPointsCostMatrix" -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" - msgid "pgr_withPointsKSP" msgstr "pgr_withPointsKSP" -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" - msgid "Functions promoted to official" msgstr "Funktioner som befordrats till tjänsteman" @@ -14819,9 +14872,6 @@ msgstr "pgr_alphashape" msgid "pgr_dijkstraCostMatrix" msgstr "pgr_dijkstraCostMatrix" -msgid "pgr_drivingDistance" -msgstr "pgr_drivingDistance" - msgid "pgr_dijkstraVia (proposed)" msgstr "pgr_dijkstraVia (proposed)" @@ -16655,12 +16705,6 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "Functionality might not change. (But still can)" #~ msgstr "Funktionaliteten kanske inte ändras. (Men kan fortfarande göra det)" -#~ msgid "Possible server crash" -#~ msgstr "Möjlig serverkrasch" - -#~ msgid "These functions might create a server crash" -#~ msgstr "Dessa funktioner kan orsaka en serverkrasch" - #~ msgid "Might need c/c++ coding." #~ msgstr "Kan behöva c/c++-kodning." diff --git a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po index 0a81c236945..782d6bf87f5 100644 --- a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po @@ -12,7 +12,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2026-06-10 19:05+0000\n" +"POT-Creation-Date: 2026-08-08 21:44+0000\n" "PO-Revision-Date: 2025-09-22 16:28+0000\n" "Last-Translator: Celia Virginia Vergara Castillo \n" "Language-Team: Chinese (Simplified) \n" @@ -348,6 +348,12 @@ msgstr ":doc:`pgr_trspVia_withPoints` - 通过有限制的顶点/点路由。" msgid "Experimental" msgstr ":doc:`experimental`" +msgid "Possible server crash" +msgstr "" + +msgid "These functions might create a server crash" +msgstr "" + msgid "Experimental functions" msgstr "实验性函数" @@ -3604,6 +3610,10 @@ msgstr "`#2683 `__: pgr_trsp msgid "`#3113 `__: Components: Integrate into existing process/driver pair" msgstr "`#2683 `__: pgr_trsp" +#, fuzzy +msgid "`#3129 `__: breadthFirstSearch: Reorganize into traversal" +msgstr "`#2683 `__: pgr_trsp" + msgid "Bug Fixes" msgstr "Bug修复" @@ -9732,6 +9742,13 @@ msgstr "``pgr_dijkstraVia``" msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "``pgr_dijkstraVia`` - 经过顶点列表的路径。" +#, fuzzy +msgid "Version 4.0.2" +msgstr "Version 4.0.0" + +msgid "Fix: bad alloc" +msgstr "" + msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." msgstr "给定一个顶点列表和一个图，该函数等价于为所有 :math:`i < size\\_of(via\\;vertices)`的 :math:`vertex_i` 和 :math:`vertex_{i+1}` 之间找到最短路径。" @@ -9816,6 +9833,15 @@ msgstr ":doc:`dijkstra-family`。" msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "``pgr_drivingDistance`` - 返回起始节点的行驶距离。" +msgid "Standardizing negative distance behaviour" +msgstr "" + +msgid "Throws when :math:`distance < 0`." +msgstr "" + +msgid "Standard message and hint." +msgstr "" + msgid "pgr_drivingDistance(Single vertex)" msgstr "pgr_drivingDistance(Single vertex)" @@ -13076,6 +13102,41 @@ msgstr "pgRouting 4.0" msgid "pgRouting 4.0" msgstr "pgRouting 4.0" +#, fuzzy +msgid "pgRouting 4.0.2 Release Notes" +msgstr "pgRouting 3.0.1 发布说明" + +#, fuzzy +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.2 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列表 `__" + +msgid "4.0.2 Summary of changes by function" +msgstr "" + +msgid "pgr_dijkstraVia" +msgstr "pgr_dijkstraVia" + +msgid "pgr_drivingDistance" +msgstr "pgr_drivingDistance" + +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" + +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" + +#, fuzzy +msgid "4.0.2 Bug Fixes" +msgstr "Bug修复" + +#, fuzzy +msgid "`#3110 `__: pgr_dijkstraVia throws std::bad_alloc when a node does not exist" +msgstr "`#1640 `__: pgr_withPoints 在 points_sql 为空时失败" + +#, fuzzy +msgid "`#3091 `__: Catchment functions when negative distance do not have a standardized behaviour" +msgstr "`#2683 `__: pgr_trsp" + #, fuzzy msgid "pgRouting 4.0.1 Release Notes" msgstr "pgRouting 3.0.1 发布说明" @@ -13283,9 +13344,6 @@ msgstr "pgr_dijkstraNear" msgid "pgr_dijkstraNearCost" msgstr "pgr_dijkstraNearCost" -msgid "pgr_dijkstraVia" -msgstr "pgr_dijkstraVia" - msgid "pgr_edgeDisjointPaths" msgstr "pgr_edgeDisjointPaths" @@ -13352,15 +13410,9 @@ msgstr "pgr_withPointsCost" msgid "pgr_withPointsCostMatrix" msgstr "pgr_withPointsCostMatrix" -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" - msgid "pgr_withPointsKSP" msgstr "pgr_withPointsKSP" -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" - msgid "Functions promoted to official" msgstr "正式版功能函数" @@ -15412,9 +15464,6 @@ msgstr "pgr_alphashape" msgid "pgr_dijkstraCostMatrix" msgstr "pgr_dijkstraCostMatrix" -msgid "pgr_drivingDistance" -msgstr "pgr_drivingDistance" - msgid "pgr_dijkstraVia (proposed)" msgstr "pgr_dijkstraVia (提议)"