Commit 8aeea4f7 authored by Bas Couwenberg's avatar Bas Couwenberg

New upstream version 2.5.2

parent b6ba3558
......@@ -182,7 +182,7 @@ endif()
set(PGROUTING_VERSION_MAJOR "2")
set(PGROUTING_VERSION_MINOR "5")
set(PGROUTING_VERSION_PATCH "1")
set(PGROUTING_VERSION_PATCH "2")
set(PGROUTING_VERSION_DEV "")
set(PGROUTING_SHORT_VERSION "${PGROUTING_VERSION_MAJOR}.${PGROUTING_VERSION_MINOR}")
......
pgRouting 2.5.2 Release Notes
-------------------------------------------------------------------------------
To see the issues closed by this release see the [Git closed milestone for 2.5.2 ](https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.2%22%20) on Github.
*Bug fixes*
* Fix for postgresql 10.1: Removed a copiler condition
pgRouting 2.5.1 Release Notes
-------------------------------------------------------------------------------
......
......@@ -6,8 +6,8 @@
### Branches
* The *master* branch has the release 2.5.1
* The *release/2.5* branch has the next micro-release 2.5.2 (if needed)
* The *master* branch has the release 2.5.2
* The *release/2.5* branch has the next micro-release 2.5.3 (if needed)
* The *develop* branch has the development of the next minor-release 2.6.0-dev
For the complete list of releases go to:
......
6238-de7557554 master
6254-60585f1f7 master
......@@ -103,7 +103,7 @@ if not exist "C:\Progra~1\PostgreSQL\%PG_VER%\makepostgisdb_using_extensions.bat
if not exist %DOWNLOADS_DIR%\postgis-%PG_VER_NO_DOT%-binaries-%PGIS_VERSION%w%arch%gcc%GCC%.zip (
echo Downloading PostGIS %PGIS_VERSION%
pushd %DOWNLOADS_DIR%
curl -L -O -S -s http://winnie.postgis.net/download/windows/%PG_VER_NO_DOT%/buildbot/postgis-%PG_VER_NO_DOT%-binaries-%PGIS_VERSION%w%arch%gcc%GCC%.zip
curl -L -O -S -s http://winnie.postgis.net/download/windows/%PG_VER_NO_DOT%/buildbot/archive/postgis-%PG_VER_NO_DOT%-binaries-%PGIS_VERSION%w%arch%gcc%GCC%.zip
popd
if not exist %DOWNLOADS_DIR%\postgis-%PG_VER_NO_DOT%-binaries-%PGIS_VERSION%w%arch%gcc%GCC%.zip (
echo something went wrong on PostGIS %PGIS_VERSION% download !!!!!!!!!
......
......@@ -13,7 +13,7 @@
All Pairs - Family of Functions
===============================================================================
The following functions work an all vertices pair combinations
The following functions work on all vertices pair combinations
.. index from here
......
......@@ -30,7 +30,7 @@ pair of nodes in the graph using Floyd-Warshall algorithm.
The Floyd-Warshall algorithm, also known as Floyd's algorithm,
is a good choice to calculate the sum of the costs of the shortest path for each
pair of nodes in the graph, for *dense graphs*. We make use of the Boost's
pair of nodes in the graph, for *dense graphs*. We use Boost's
implementation which runs in :math:`\Theta(V^3)` time,
......
......@@ -57,8 +57,8 @@ where :math:`sql = \{(id_i, source_i, target_i, cost_i, reverse\_cost_i)\}`
and
- :math:`source = \bigcup source_i`,
- :math:`target = \bigcup target_i`,
- :math:`source = \bigcup source_i`,
- :math:`target = \bigcup target_i`,
The graphs are defined as follows:
......@@ -71,20 +71,28 @@ The weighted undirected graph, :math:`G(V,E)`, is definied by:
* the set of edges :math:`E`
- :math:`E = \begin{cases} &\{(source_i, target_i, cost_i) \text{ when } cost >=0 \} \\ \cup &\{(target_i, source_i, cost_i) \text{ when } cost >=0 \} &\quad \text{ if } reverse\_cost = \varnothing \\ \\ &\{(source_i, target_i, cost_i) \text{ when } cost >=0 \} \\ \cup &\{(target_i, source_i, cost_i) \text{ when } cost >=0 \} \\ \cup &\{(target_i, source_i, reverse\_cost_i) \text{ when } reverse\_cost_i >=0)\} \\ \cup &\{(source_i, target_i, reverse\_cost_i) \text{ when } reverse\_cost_i >=0)\} &\quad \text{ if } reverse\_cost \neq \varnothing \\ \end{cases}`
- :math:`E = \begin{cases}
\text{ } \{(source_i, target_i, cost_i) \text{ when } cost >=0 \} & \quad \text{ } \\
\cup \{(target_i, source_i, cost_i) \text{ when } cost >=0 \} & \quad \text{ if } reverse\_cost = \varnothing \\
\text{ } \text{ } & \text{ } \\
\text{ } \{(source_i, target_i, cost_i) \text{ when } cost >=0 \} & \text{ } \\
\cup \{(target_i, source_i, cost_i) \text{ when } cost >=0 \} & \text{ } \\
\cup \{(target_i, source_i, reverse\_cost_i) \text{ when } reverse\_cost_i >=0)\} & \text{ } \\
\cup \{(source_i, target_i, reverse\_cost_i) \text{ when } reverse\_cost_i >=0)\} & \quad \text{ if } reverse\_cost \neq \varnothing \\
\end{cases}`
Given:
- :math:`G(V,E)`
- :math:`G(V,E)`
Then:
.. math:: \text{pgr_connectedComponentsV}(sql) =
.. math::`pgr_connectedComponentsV(sql) =
\begin{cases}
\text{all connected components } \boldsymbol{\pi} \text{ in } G(V,E) &\quad \text{if } \exists \boldsymbol{\pi} \\
\varnothing &\quad \text{otherwise} \\
\end{cases}
\end{cases}`
:math:`\boldsymbol{\pi} = \{(component_i, n\_seq_i, node_i)\}`
......@@ -123,8 +131,8 @@ where :math:`sql = \{(id_i, source_i, target_i, cost_i, reverse\_cost_i)\}`
and
- :math:`source = \bigcup source_i`,
- :math:`target = \bigcup target_i`,
- :math:`source = \bigcup source_i`,
- :math:`target = \bigcup target_i`,
The graphs are defined as follows:
......@@ -136,20 +144,25 @@ The weighted directed graph, :math:`G_d(V,E)`, is definied by:
* the set of edges :math:`E`
- :math:`E = \begin{cases} &\{(source_i, target_i, cost_i) \text{ when } cost >=0 \} &\quad \text{ if } reverse\_cost = \varnothing \\ \\ &\{(source_i, target_i, cost_i) \text{ when } cost >=0 \} \\ \cup &\{(target_i, source_i, reverse\_cost_i) \text{ when } reverse\_cost_i >=0)\} &\quad \text{ if } reverse\_cost \neq \varnothing \\ \end{cases}`
- :math:`E = \begin{cases}
\text{ } \{(source_i, target_i, cost_i) \text{ when } cost >=0 \} & \quad \text{ if } reverse\_cost = \varnothing \\
\text{ } \text{ } & \text{ } \\
\text{ } \{(source_i, target_i, cost_i) \text{ when } cost >=0 \} & \text{ } \\
\cup \{(target_i, source_i, reverse\_cost_i) \text{ when } reverse\_cost_i >=0)\} & \quad \text{ if } reverse\_cost \neq \varnothing \\
\end{cases}`
Given:
- :math:`G(V,E)`
- :math:`G(V,E)`
Then:
.. math:: \text{pgr_strongComponentsV}(sql) =
.. math::`\text{pgr_strongComponentsV}(sql) =
\begin{cases}
\text{all strongly connected components } \boldsymbol{\pi} \text{ in } G(V,E) &\quad \text{if } \exists \boldsymbol{\pi} \\
\varnothing &\quad \text{otherwise} \\
\end{cases}
\end{cases}`
:math:`\boldsymbol{\pi} = \{(component_i, n\_seq_i, node_i)\}`
......@@ -191,8 +204,8 @@ where :math:`sql = \{(id_i, source_i, target_i, cost_i, reverse\_cost_i)\}`
and
- :math:`source = \bigcup source_i`,
- :math:`target = \bigcup target_i`,
- :math:`source = \bigcup source_i`,
- :math:`target = \bigcup target_i`,
The graphs are defined as follows:
......@@ -205,20 +218,28 @@ The weighted undirected graph, :math:`G(V,E)`, is definied by:
* the set of edges :math:`E`
- :math:`E = \begin{cases} &\{(source_i, target_i, cost_i) \text{ when } cost >=0 \} \\ \cup &\{(target_i, source_i, cost_i) \text{ when } cost >=0 \} &\quad \text{ if } reverse\_cost = \varnothing \\ \\ &\{(source_i, target_i, cost_i) \text{ when } cost >=0 \} \\ \cup &\{(target_i, source_i, cost_i) \text{ when } cost >=0 \} \\ \cup &\{(target_i, source_i, reverse\_cost_i) \text{ when } reverse\_cost_i >=0)\} \\ \cup &\{(source_i, target_i, reverse\_cost_i) \text{ when } reverse\_cost_i >=0)\} &\quad \text{ if } reverse\_cost \neq \varnothing \\ \end{cases}`
- :math:`E = \begin{cases}
\text{ } \{(source_i, target_i, cost_i) \text{ when } cost >=0 \} & \quad \text{ } \\
\cup \{(target_i, source_i, cost_i) \text{ when } cost >=0 \} & \quad \text{ if } reverse\_cost = \varnothing \\
\text{ } \text{ } & \text{ } \\
\text{ } \{(source_i, target_i, cost_i) \text{ when } cost >=0 \} & \text{ } \\
\cup \{(target_i, source_i, cost_i) \text{ when } cost >=0 \} & \text{ } \\
\cup \{(target_i, source_i, reverse\_cost_i) \text{ when } reverse\_cost_i >=0)\} & \text{ } \\
\cup \{(source_i, target_i, reverse\_cost_i) \text{ when } reverse\_cost_i >=0)\} & \quad \text{ if } reverse\_cost \neq \varnothing \\
\end{cases}`
Given:
- :math:`G(V,E)`
- :math:`G(V,E)`
Then:
.. math:: \text{pgr_biconnectedComponents}(sql) =
.. math::`\text{pgr_biconnectedComponents}(sql) =
\begin{cases}
\text{all biconnected components } \boldsymbol{\pi} \text{ in } G(V,E) &\quad \text{if } \exists \boldsymbol{\pi} \\
\varnothing &\quad \text{otherwise} \\
\end{cases}
\end{cases}`
:math:`\boldsymbol{\pi} = \{(component_i, n\_seq_i, node_i)\}`
......@@ -260,8 +281,8 @@ where :math:`sql = \{(id_i, source_i, target_i, cost_i, reverse\_cost_i)\}`
and
- :math:`source = \bigcup source_i`,
- :math:`target = \bigcup target_i`,
- :math:`source = \bigcup source_i`,
- :math:`target = \bigcup target_i`,
The graphs are defined as follows:
......@@ -274,20 +295,28 @@ The weighted undirected graph, :math:`G(V,E)`, is definied by:
* the set of edges :math:`E`
- :math:`E = \begin{cases} &\{(source_i, target_i, cost_i) \text{ when } cost >=0 \} \\ \cup &\{(target_i, source_i, cost_i) \text{ when } cost >=0 \} &\quad \text{ if } reverse\_cost = \varnothing \\ \\ &\{(source_i, target_i, cost_i) \text{ when } cost >=0 \} \\ \cup &\{(target_i, source_i, cost_i) \text{ when } cost >=0 \} \\ \cup &\{(target_i, source_i, reverse\_cost_i) \text{ when } reverse\_cost_i >=0)\} \\ \cup &\{(source_i, target_i, reverse\_cost_i) \text{ when } reverse\_cost_i >=0)\} &\quad \text{ if } reverse\_cost \neq \varnothing \\ \end{cases}`
- :math:`E = \begin{cases}
\text{ } \{(source_i, target_i, cost_i) \text{ when } cost >=0 \} & \quad \text{ } \\
\cup \{(target_i, source_i, cost_i) \text{ when } cost >=0 \} & \quad \text{ if } reverse\_cost = \varnothing \\
\text{ } \text{ } & \text{ } \\
\text{ } \{(source_i, target_i, cost_i) \text{ when } cost >=0 \} & \text{ } \\
\cup \{(target_i, source_i, cost_i) \text{ when } cost >=0 \} & \text{ } \\
\cup \{(target_i, source_i, reverse\_cost_i) \text{ when } reverse\_cost_i >=0)\} & \text{ } \\
\cup \{(source_i, target_i, reverse\_cost_i) \text{ when } reverse\_cost_i >=0)\} & \quad \text{ if } reverse\_cost \neq \varnothing \\
\end{cases}`
Given:
- :math:`G(V,E)`
- :math:`G(V,E)`
Then:
.. math:: \text{pgr_articulationPoints}(sql) =
.. math::`\text{pgr_articulationPoints}(sql) =
\begin{cases}
\text{all articulation points } \boldsymbol{\pi} \text{ in } G(V,E) &\quad \text{if } \exists \boldsymbol{\pi} \\
\varnothing &\quad \text{otherwise} \\
\end{cases}
\end{cases}`
:math:`\boldsymbol{\pi} = \{node_i\}`
......@@ -320,8 +349,8 @@ where :math:`sql = \{(id_i, source_i, target_i, cost_i, reverse\_cost_i)\}`
and
- :math:`source = \bigcup source_i`,
- :math:`target = \bigcup target_i`,
- :math:`source = \bigcup source_i`,
- :math:`target = \bigcup target_i`,
The graphs are defined as follows:
......@@ -334,20 +363,28 @@ The weighted undirected graph, :math:`G(V,E)`, is definied by:
* the set of edges :math:`E`
- :math:`E = \begin{cases} &\{(source_i, target_i, cost_i) \text{ when } cost >=0 \} \\ \cup &\{(target_i, source_i, cost_i) \text{ when } cost >=0 \} &\quad \text{ if } reverse\_cost = \varnothing \\ \\ &\{(source_i, target_i, cost_i) \text{ when } cost >=0 \} \\ \cup &\{(target_i, source_i, cost_i) \text{ when } cost >=0 \} \\ \cup &\{(target_i, source_i, reverse\_cost_i) \text{ when } reverse\_cost_i >=0)\} \\ \cup &\{(source_i, target_i, reverse\_cost_i) \text{ when } reverse\_cost_i >=0)\} &\quad \text{ if } reverse\_cost \neq \varnothing \\ \end{cases}`
- :math:`E = \begin{cases}
\text{ } \{(source_i, target_i, cost_i) \text{ when } cost >=0 \} & \quad \text{ } \\
\cup \{(target_i, source_i, cost_i) \text{ when } cost >=0 \} & \quad \text{ if } reverse\_cost = \varnothing \\
\text{ } \text{ } & \text{ } \\
\text{ } \{(source_i, target_i, cost_i) \text{ when } cost >=0 \} & \text{ } \\
\cup \{(target_i, source_i, cost_i) \text{ when } cost >=0 \} & \text{ } \\
\cup \{(target_i, source_i, reverse\_cost_i) \text{ when } reverse\_cost_i >=0)\} & \text{ } \\
\cup \{(source_i, target_i, reverse\_cost_i) \text{ when } reverse\_cost_i >=0)\} & \quad \text{ if } reverse\_cost \neq \varnothing \\
\end{cases}`
Given:
- :math:`G(V,E)`
- :math:`G(V,E)`
Then:
.. math:: \text{pgr_bridges}(sql) =
.. math::`\text{pgr_bridges}(sql) =
\begin{cases}
\text{all bridges } \boldsymbol{\pi} \text{ in } G(V,E) &\quad \text{if } \exists \boldsymbol{\pi} \\
\varnothing &\quad \text{otherwise} \\
\end{cases}
\end{cases}`
:math:`\boldsymbol{\pi} = \{edge_i\}`
......
......@@ -6,7 +6,7 @@ SET
SELECT version FROM pgr_version();
version
---------
2.5.1
2.5.2
(1 row)
-- q2
......
......@@ -18,6 +18,7 @@ To see the full list of changes check the list of `Git commits <https://github.c
.. changelog start
* :ref:`changelog_2_5_2`
* :ref:`changelog_2_5_1`
* :ref:`changelog_2_5_0`
* :ref:`changelog_2_4_2`
......@@ -38,6 +39,18 @@ To see the full list of changes check the list of `Git commits <https://github.c
.. changelog end
.. _changelog_2_5_2:
pgRouting 2.5.2 Release Notes
-------------------------------------------------------------------------------
To see the issues closed by this release see the `Git closed milestone for 2.5.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.2%22%20>`_ on Github.
.. rubric:: Bug fixes
* Fix for postgresql 10.1: Removed a copiler condition
.. _changelog_2_5_1:
pgRouting 2.5.1 Release Notes
......
SET(OLD_SIGNATURES
2.5.1
2.5.0
2.4.2
2.4.1
......
#VERSION pgrouting 2.5.2
#TYPES
pgr_costresult
pgr_costresult3
pgr_geomresult
#FUNCTIONS
pgr_alphashape(text,double precision)
pgr_analyzegraph(text,double precision,text,text,text,text,text)
pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)
pgr_apspjohnson(text)
pgr_apspwarshall(text,boolean,boolean)
pgr_articulationpoints(text)
pgr_astarcostmatrix(text,anyarray,boolean,integer,double precision,double precision)
pgr_astarcost(text,anyarray,anyarray,boolean,integer,double precision,double precision)
pgr_astarcost(text,anyarray,bigint,boolean,integer,double precision,double precision)
pgr_astarcost(text,bigint,anyarray,boolean,integer,double precision,double precision)
pgr_astarcost(text,bigint,bigint,boolean,integer,double precision,double precision)
pgr_astar(text,anyarray,anyarray,boolean,integer,double precision,double precision)
_pgr_astar(text,anyarray,anyarray,boolean,integer,double precision,double precision,boolean,boolean)
pgr_astar(text,anyarray,bigint,boolean,integer,double precision,double precision)
pgr_astar(text,bigint,anyarray,boolean,integer,double precision,double precision)
pgr_astar(text,bigint,bigint,boolean,integer,double precision,double precision)
pgr_astar(text,integer,integer,boolean,boolean)
pgr_bdastarcostmatrix(text,anyarray,boolean,integer,numeric,numeric)
pgr_bdastarcost(text,anyarray,anyarray,boolean,integer,numeric,numeric)
pgr_bdastarcost(text,anyarray,bigint,boolean,integer,numeric,numeric)
pgr_bdastarcost(text,bigint,anyarray,boolean,integer,numeric,numeric)
pgr_bdastarcost(text,bigint,bigint,boolean,integer,numeric,numeric)
_pgr_bdastar(text,anyarray,anyarray,boolean,integer,double precision,double precision,boolean)
pgr_bdastar(text,anyarray,anyarray,boolean,integer,numeric,numeric)
pgr_bdastar(text,anyarray,bigint,boolean,integer,numeric,numeric)
pgr_bdastar(text,bigint,anyarray,boolean,integer,numeric,numeric)
pgr_bdastar(text,bigint,bigint)
pgr_bdastar(text,bigint,bigint,boolean,integer,numeric,numeric)
pgr_bdastar(text,integer,integer,boolean,boolean)
pgr_bddijkstracostmatrix(text,anyarray,boolean)
pgr_bddijkstracost(text,anyarray,anyarray,boolean)
pgr_bddijkstracost(text,anyarray,bigint,boolean)
pgr_bddijkstracost(text,bigint,anyarray,boolean)
pgr_bddijkstracost(text,bigint,bigint,boolean)
pgr_bddijkstra(text,anyarray,anyarray,boolean)
_pgr_bddijkstra(text,anyarray,anyarray,boolean,boolean)
pgr_bddijkstra(text,anyarray,bigint,boolean)
pgr_bddijkstra(text,bigint,anyarray,boolean)
pgr_bddijkstra(text,bigint,bigint)
pgr_bddijkstra(text,bigint,bigint,boolean)
pgr_bddijkstra(text,integer,integer,boolean,boolean)
pgr_biconnectedcomponents(text)
pgr_boykovkolmogorov(text,anyarray,anyarray)
pgr_boykovkolmogorov(text,anyarray,bigint)
pgr_boykovkolmogorov(text,bigint,anyarray)
pgr_boykovkolmogorov(text,bigint,bigint)
pgr_bridges(text)
_pgr_checkverttab(text,text[],integer,text)
pgr_connectedcomponents(text)
pgr_contractgraph(text,bigint[],integer,bigint[],boolean)
_pgr_createindex(text,text,text,integer,text)
_pgr_createindex(text,text,text,text,integer,text)
pgr_createtopology(text,double precision,text,text,text,text,text,boolean)
pgr_createverticestable(text,text,text,text,text)
pgr_dijkstracostmatrix(text,anyarray,boolean)
pgr_dijkstracost(text,anyarray,anyarray,boolean)
pgr_dijkstracost(text,anyarray,bigint,boolean)
pgr_dijkstracost(text,bigint,anyarray,boolean)
pgr_dijkstracost(text,bigint,bigint,boolean)
pgr_dijkstra(text,anyarray,anyarray,boolean)
_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean)
pgr_dijkstra(text,anyarray,bigint,boolean)
pgr_dijkstra(text,bigint,anyarray,boolean)
pgr_dijkstra(text,bigint,bigint)
pgr_dijkstra(text,bigint,bigint,boolean)
pgr_dijkstra(text,integer,integer,boolean,boolean)
pgr_dijkstravia(text,anyarray,boolean,boolean,boolean)
pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)
pgr_drivingdistance(text,bigint,double precision,boolean)
pgr_drivingdistance(text,bigint,double precision,boolean,boolean)
pgr_edgedisjointpaths(text,anyarray,anyarray,boolean)
pgr_edgedisjointpaths(text,anyarray,bigint,boolean)
pgr_edgedisjointpaths(text,bigint,anyarray,boolean)
pgr_edgedisjointpaths(text,bigint,bigint,boolean)
pgr_edmondskarp(text,anyarray,anyarray)
pgr_edmondskarp(text,anyarray,bigint)
pgr_edmondskarp(text,bigint,anyarray)
pgr_edmondskarp(text,bigint,bigint)
_pgr_endpoint(geometry)
pgr_endpoint(geometry)
pgr_euclediantsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)
pgr_flipedges(geometry[])
pgr_floydwarshall(text,boolean)
pgr_getcolumnname(text,text)
_pgr_getcolumnname(text,text,integer,text)
_pgr_getcolumnname(text,text,text,integer,text)
_pgr_getcolumntype(text,text,integer,text)
_pgr_getcolumntype(text,text,text,integer,text)
_pgr_get_statement(text)
pgr_gettablename(text)
_pgr_gettablename(text,integer,text)
_pgr_gsoc_vrppdtw(text,integer,double precision,double precision,integer)
pgr_gsoc_vrppdtw(text,integer,integer)
pgr_iscolumnindexed(text,text)
_pgr_iscolumnindexed(text,text,integer,text)
_pgr_iscolumnindexed(text,text,text,integer,text)
_pgr_iscolumnintable(text,text)
pgr_iscolumnintable(text,text)
pgr_johnson(text,boolean)
pgr_kdijkstracost(text,integer,integer[],boolean,boolean)
pgr_kdijkstrapath(text,integer,integer[],boolean,boolean)
_pgr_ksp(text,bigint,bigint,integer,boolean,boolean)
pgr_ksp(text,bigint,bigint,integer,boolean,boolean)
pgr_ksp(text,integer,integer,integer,boolean)
pgr_labelgraph(text,text,text,text,text,text)
pgr_linegraph(text,boolean)
_pgr_makedistancematrix(text)
pgr_maxcardinalitymatch(text,boolean)
pgr_maxflowboykovkolmogorov(text,anyarray,anyarray)
pgr_maxflowboykovkolmogorov(text,anyarray,bigint)
pgr_maxflowboykovkolmogorov(text,bigint,anyarray)
pgr_maxflowboykovkolmogorov(text,bigint,bigint)
pgr_maxflowedmondskarp(text,anyarray,anyarray)
pgr_maxflowedmondskarp(text,anyarray,bigint)
pgr_maxflowedmondskarp(text,bigint,anyarray)
pgr_maxflowedmondskarp(text,bigint,bigint)
pgr_maxflowpushrelabel(text,anyarray,anyarray)
pgr_maxflowpushrelabel(text,anyarray,bigint)
pgr_maxflowpushrelabel(text,bigint,anyarray)
pgr_maxflowpushrelabel(text,bigint,bigint)
pgr_maxflow(text,anyarray,anyarray)
_pgr_maxflow(text,anyarray,anyarray,integer,boolean)
pgr_maxflow(text,anyarray,bigint)
pgr_maxflow(text,bigint,anyarray)
pgr_maxflow(text,bigint,bigint)
pgr_maximumcardinalitymatching(text,boolean)
_pgr_msg(integer,text,text)
pgr_nodenetwork(text,double precision,text,text,text,text,boolean)
_pgr_onerror(boolean,integer,text,text,text,text)
_pgr_parameter_check(text,text,boolean)
_pgr_pickdelivereuclidean(text,text,double precision,integer,integer)
_pgr_pickdeliver(text,text,text,double precision,integer,integer)
pgr_pointsaspolygon(character varying,double precision)
pgr_pointstodmatrix(geometry[],integer)
pgr_pointstovids(geometry[],text,double precision)
pgr_pointtoedgenode(text,geometry,double precision)
_pgr_pointtoid(geometry,double precision,text,integer)
pgr_pushrelabel(text,anyarray,anyarray)
pgr_pushrelabel(text,anyarray,bigint)
pgr_pushrelabel(text,bigint,anyarray)
pgr_pushrelabel(text,bigint,bigint)
_pgr_quote_ident(text)
pgr_quote_ident(text)
_pgr_startpoint(geometry)
pgr_startpoint(geometry)
pgr_strongcomponents(text)
pgr_texttopoints(text,integer)
_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)
pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)
_pgr_trsp(text,integer,integer,boolean,boolean,text)
pgr_trsp(text,integer,integer,boolean,boolean,text)
pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)
pgr_trspviavertices(text,anyarray,boolean,boolean,text)
_pgr_trspviavertices(text,integer[],boolean,boolean,text)
pgr_tsp(double precision[],integer,integer)
pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)
pgr_tsp(text,integer,integer)
_pgr_unnest_matrix(double precision[])
pgr_version()
_pgr_versionless(text,text)
pgr_versionless(text,text)
pgr_vidstodmatrix(integer[],geometry[],text,double precision)
pgr_vidstodmatrix(text,integer[],boolean,boolean,boolean)
_pgr_vrponedepot(text,text,text,integer)
pgr_vrponedepot(text,text,text,integer)
pgr_withpointscostmatrix(text,text,anyarray,boolean,character)
pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)
pgr_withpointscost(text,text,anyarray,bigint,boolean,character)
pgr_withpointscost(text,text,bigint,anyarray,boolean,character)
pgr_withpointscost(text,text,bigint,bigint,boolean,character)
pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)
pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)
pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)
pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)
_pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean,boolean,boolean)
pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)
pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)
pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)
_pgr_withpointsvia(text,bigint[],double precision[],boolean)
......@@ -23,9 +23,7 @@ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
********************************************************************PGR-GNU*/
#include "c_common/postgres_connection.h"
#if PGSQL_VERSION == 100
#include <float.h>
#endif
#include "catalog/pg_type.h"
......
......@@ -6,7 +6,7 @@ SET
SELECT version FROM pgr_version();
version
---------
2.5.1
2.5.2
(1 row)
-- q2
......
......@@ -42,7 +42,7 @@ if [ -f sql/sigs/pgrouting--$1.sig ]
then
echo "- [x] sql/sigs/pgrouting--$1.sig"
else
error_msg " FATAL: tools/sigs/pgrouting--$1.sig Not found"
error_msg " FATAL: sql/sigs/pgrouting--$1.sig Not found"
exit 1
fi
}
......@@ -264,13 +264,13 @@ if [[ -n $DEBUG ]]; then
echo "\`\`\`"
fi
if [[ "$BRANCH" != "master" ]]; then
if [[ "$BRANCH" != "master" && "$BRANCH" != "release/$MAYOR.$MINOR" ]]; then
if [[ $(cat VERSION | grep "release/$MAYOR.$MINOR") != *"release/$MAYOR.$MINOR" ]]; then
error_msg "VERSION should have release/$MAYOR.$MINOR"
exit 1
fi
else
if [[ $(cat VERSION | grep "$BRANCH") != *"master" ]]; then
if [[ $(cat VERSION | grep "master") != *"master" ]]; then
error_msg "VERSION should have master"
exit 1
fi
......@@ -282,6 +282,7 @@ echo
echo "### Checking signature files exist"
echo
#---------------------------------------------------------------------
test_file 2.5.2
test_file 2.5.1
test_file 2.5.0
test_file 2.4.2
......@@ -330,7 +331,8 @@ echo - [x] completed local builds
echo "### checking the signature files dont change"
#---------------------------------------------------------------------
sh tools/release-scripts/get_signatures.sh 2.5.1 ___sig_generate___ sql/sigs >> build/tmp_sigs.txt
sh tools/release-scripts/get_signatures.sh 2.5.2 ___sig_generate___ sql/sigs >> build/tmp_sigs.txt
test_file 2.5.1
test_file 2.5.0
test_file 2.4.2
test_file 2.4.1
......
-- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
-- pgRouting extension upgrade from 2.0.0 to 2.5.1
-- pgRouting extension upgrade from 2.0.0 to 2.5.2
-- generated by tools/build-extension-update-files
-- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
\echo Use "ALTER extension pgrouting update to '2.5.1'" to load this file. \quit
\echo Use "ALTER extension pgrouting update to '2.5.2'" to load this file. \quit
-------------------------------------
-- remove functions no longer in the 2.5.1 extension
-- remove functions no longer in the 2.5.2 extension
-------------------------------------
......@@ -50,7 +50,7 @@ DROP FUNCTION IF EXISTS pgr_pointtoid(geometry,double precision,text,integer);
------------------------------------------
-- pgr_dijkstra:
-- 2.0.0: { sql, source_id, target_id, directed, has_reverse_cost}
-- 2.5.1: {edges_sql, start_vid, end_vid, directed, has_rcost}
-- 2.5.2: {edges_sql, start_vid, end_vid, directed, has_rcost}
ALTER EXTENSION pgrouting DROP FUNCTION pgr_dijkstra(text,integer,integer,boolean,boolean);
DROP FUNCTION IF EXISTS pgr_dijkstra(text,integer,integer,boolean,boolean);
......@@ -65,7 +65,7 @@ DROP FUNCTION IF EXISTS pgr_dijkstra(text,integer,integer,boolean,boolean);
------------------------------------------
-- pgr_ksp
-- 2.0.0: { sql, source_id, target_id, no_paths,has_reverse_cost}
-- 2.5.1: {edges_sql, start_vid, end_vid, k, has_rcost}
-- 2.5.2: {edges_sql, start_vid, end_vid, k, has_rcost}
ALTER EXTENSION pgrouting DROP FUNCTION pgr_ksp(text,integer,integer,integer,boolean);
DROP FUNCTION IF EXISTS pgr_ksp(text,integer,integer,integer,boolean);
......@@ -80,7 +80,7 @@ DROP FUNCTION IF EXISTS pgr_ksp(text,integer,integer,integer,boolean);
------------------------------------------
-- pgr_apspjohnson
-- 2.0.0: { sql}
-- 2.5.1: {edges_sql}
-- 2.5.2: {edges_sql}
ALTER EXTENSION pgrouting DROP FUNCTION pgr_apspjohnson(text);
DROP FUNCTION IF EXISTS pgr_apspjohnson(text);
......@@ -88,7 +88,7 @@ DROP FUNCTION IF EXISTS pgr_apspjohnson(text);
-- pgr_apspwarshall
-- 2.0.0: { sql, directed, has_reverse_cost}
-- 2.5.1: {edges_sql, directed, has_rcost}
-- 2.5.2: {edges_sql, directed, has_rcost}
ALTER EXTENSION pgrouting DROP FUNCTION pgr_apspwarshall(text,boolean,boolean);
DROP FUNCTION IF EXISTS pgr_apspwarshall(text,boolean,boolean);
......@@ -96,7 +96,7 @@ DROP FUNCTION IF EXISTS pgr_apspwarshall(text,boolean,boolean);
-- pgr_kdijkstrapath
-- 2.0.0: {sql,source_vid, target_vid, directed, has_reverse_cost}
-- 2.5.1: {sql, source, targets, directed, has_rcost}
-- 2.5.2: {sql, source, targets, directed, has_rcost}
ALTER EXTENSION pgrouting DROP FUNCTION pgr_kdijkstrapath(text,integer,integer[],boolean,boolean);
DROP FUNCTION IF EXISTS pgr_kdijkstrapath(text,integer,integer[],boolean,boolean);
......@@ -104,7 +104,7 @@ DROP FUNCTION IF EXISTS pgr_kdijkstrapath(text,integer,integer[],boolean,boolean
-- pgr_kdijkstracost
-- 2.0.0: {sql,source_vid, target_vid, directed, has_reverse_cost}
-- 2.5.1: {sql, source, targets, directed, has_rcost}
-- 2.5.2: {sql, source, targets, directed, has_rcost}
ALTER EXTENSION pgrouting DROP FUNCTION pgr_kdijkstracost(text,integer,integer[],boolean,boolean);
DROP FUNCTION IF EXISTS pgr_kdijkstracost(text,integer,integer[],boolean,boolean);
......@@ -118,7 +118,7 @@ DROP FUNCTION IF EXISTS pgr_kdijkstracost(text,integer,integer[],boolean,boolean
------------------------------------------
-- pgr_version
-- 2.0.0: {version,tag,build,hash,branch,boost}
-- 2.5.1: {version,tag,hash,branch,boost}
-- 2.5.2: {version,tag,hash,branch,boost}
ALTER EXTENSION pgrouting DROP FUNCTION pgr_version();
DROP FUNCTION IF EXISTS pgr_version();
......@@ -132,7 +132,7 @@ DROP FUNCTION IF EXISTS pgr_version();
------------------------------------------
-- pgr_trsp
-- 2.0.0: { sql, source_vid, target_vid, directed, has_reverse_cost, turn_restrict_sql}
-- 2.5.1: {edges_sql, start_vid, end_vid, directed, has_rcost, restrictions_sql}
-- 2.5.2: {edges_sql, start_vid, end_vid, directed, has_rcost, restrictions_sql}
UPDATE pg_proc SET
proargnames = '{"edges_sql","start_vid","end_vid","directed","has_rcost","restrictions_sql"}'
......@@ -147,7 +147,7 @@ WHERE proname = 'pgr_trsp'
------------------------------------------
-- pgr_bddijkstra
-- 2.0.0: { sql, source_vid, target_vid, directed, has_reverse_cost}
-- 2.5.1: {edges_sql, start_vid, end_vid, directed, has_rcost}
-- 2.5.2: {edges_sql, start_vid, end_vid, directed, has_rcost}
UPDATE pg_proc SET
proargnames = '{"edges_sql","start_vid","end_vid","directed","has_rcost"}'
......@@ -227,9 +227,9 @@ RETURNS TABLE(
boost varchar
) AS
$BODY$
SELECT '2.5.1'::varchar AS version,
'v2.5.1'::varchar AS tag,
'de7557554'::varchar AS hash,
SELECT '2.5.2'::varchar AS version,
'v2.5.2'::varchar AS tag,
'60585f1f7'::varchar AS hash,
'master'::varchar AS branch,
'1.54.0'::varchar AS boost;
$BODY$
......
-- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
-- pgRouting extension upgrade from 2.0.1 to 2.5.1
-- pgRouting extension upgrade from 2.0.1 to 2.5.2
-- generated by tools/build-extension-update-files
-- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
\echo Use "ALTER extension pgrouting update to '2.5.1'" to load this file. \quit
\echo Use "ALTER extension pgrouting update to '2.5.2'" to load this file. \quit
-------------------------------------
-- remove functions no longer in the 2.5.1 extension
-- remove functions no longer in the 2.5.2 extension
-------------------------------------
......@@ -50,7 +50,7 @@ DROP FUNCTION IF EXISTS pgr_pointtoid(geometry,double precision,text,integer);
------------------------------------------
-- pgr_dijkstra:
-- 2.0.1: { sql, source_id, target_id, directed, has_reverse_cost}
-- 2.5.1: {edges_sql, start_vid, end_vid, directed, has_rcost}
-- 2.5.2: {edges_sql, start_vid, end_vid, directed, has_rcost}
ALTER EXTENSION pgrouting DROP FUNCTION pgr_dijkstra(text,integer,integer,boolean,boolean);
DROP FUNCTION IF EXISTS pgr_dijkstra(text,integer,integer,boolean,boolean);
......@@ -65,7 +65,7 @@ DROP FUNCTION IF EXISTS pgr_dijkstra(text,integer,integer,boolean,boolean);