提交 12cc299c 编写于 作者: T Tom Lane

Avoid direct use of INFINITY.

It's not very portable.  Per buildfarm.
上级 f941d033
...@@ -21,7 +21,8 @@ ...@@ -21,7 +21,8 @@
#include "lib/bipartite_match.h" #include "lib/bipartite_match.h"
#include "miscadmin.h" #include "miscadmin.h"
#include "utils/palloc.h" #include "utils/builtins.h"
static bool hk_breadth_search(BipartiteMatchState *state); static bool hk_breadth_search(BipartiteMatchState *state);
static bool hk_depth_search(BipartiteMatchState *state, int u, int depth); static bool hk_depth_search(BipartiteMatchState *state, int u, int depth);
...@@ -87,7 +88,7 @@ hk_breadth_search(BipartiteMatchState *state) ...@@ -87,7 +88,7 @@ hk_breadth_search(BipartiteMatchState *state)
int qtail = 0; /* so don't have to worry about wrapping */ int qtail = 0; /* so don't have to worry about wrapping */
int u; int u;
distance[0] = INFINITY; distance[0] = get_float4_infinity();
for (u = 1; u <= usize; ++u) for (u = 1; u <= usize; ++u)
{ {
...@@ -97,7 +98,7 @@ hk_breadth_search(BipartiteMatchState *state) ...@@ -97,7 +98,7 @@ hk_breadth_search(BipartiteMatchState *state)
queue[qhead++] = u; queue[qhead++] = u;
} }
else else
distance[u] = INFINITY; distance[u] = get_float4_infinity();
} }
while (qtail < qhead) while (qtail < qhead)
...@@ -156,6 +157,6 @@ hk_depth_search(BipartiteMatchState *state, int u, int depth) ...@@ -156,6 +157,6 @@ hk_depth_search(BipartiteMatchState *state, int u, int depth)
} }
} }
distance[u] = INFINITY; distance[u] = get_float4_infinity();
return false; return false;
} }
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册