Welcome to mirror list, hosted at ThFree Co, Russian Federation.

git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorSergey Sharybin <sergey.vfx@gmail.com>2015-06-13 23:17:32 +0300
committerSergey Sharybin <sergey.vfx@gmail.com>2015-06-13 23:19:50 +0300
commitb1ed12bfec529f61ee06560d05b8fcb144382fcf (patch)
treed795e1642b0cee0df823dc68ecfa0ae6bf2b828c /source/blender/blenlib/intern/astar.c
parent1c81bcffde7a2533a9e8e8bc05c9ef7f24588309 (diff)
Compilation error fixes for older GCC/CLang compilers
Avoid data type re-declaration, it's not really working on current FreeBSD's 9 system and CLang-3.0 from OSX. This is not a good idea to do such sort of copy-paste anyway. If someone knows better way of dealing with this please go ahead and correct the code :)
Diffstat (limited to 'source/blender/blenlib/intern/astar.c')
-rw-r--r--source/blender/blenlib/intern/astar.c12
1 files changed, 0 insertions, 12 deletions
diff --git a/source/blender/blenlib/intern/astar.c b/source/blender/blenlib/intern/astar.c
index 311d6dd89ae..21d974de1c4 100644
--- a/source/blender/blenlib/intern/astar.c
+++ b/source/blender/blenlib/intern/astar.c
@@ -165,18 +165,6 @@ void BLI_astar_solution_free(BLI_AStarSolution *as_solution)
}
/**
- * Callback computing the current cost (distance) to next node, and the estimated overall cost to destination node
- * (A* expects this estimation to always be less or equal than actual shortest path from next node to destination one).
- *
- * \param link the graph link between current node and next one.
- * \param node_idx_curr current node index.
- * \param node_idx_next next node index.
- * \param node_idx_dst destination node index.
- */
-typedef float (*astar_f_cost)(BLI_AStarGraph *as_graph, BLI_AStarSolution *as_solution, BLI_AStarGNLink *link,
- const int node_idx_curr, const int node_idx_next, const int node_idx_dst);
-
-/**
* Init an A* graph. Total number of nodes must be known.
*
* Nodes might be e.g. vertices, faces, ...