Re: [PATCH 01/18] Add a function to solve least-cost assignment problems

From: Duy Nguyen <pclouds@gmail.com>
Date: May 13, 2018, 18:19 UTC
Message-ID: <CACsJy8ApDb_KTjoJgMuV_AJ+dQdGC0kgCnMcJXj5pMGdqMQCyA@mail.gmail.com>
In-Reply-To: <3f51970cbc44bfe34133c48c0844ed3723e83808.1525361419.git.johannes.schindelin@gmx.de>

On Thu, May 3, 2018 at 5:30 PM, Johannes Schindelin <johannes.schindelin@gmx.de> wrote:

> +       /* reduction transfer */
> +       free_row = xmalloc(sizeof(int) * row_count);
> +       for (int i = 0; i < row_count; i++) {

travis complains about this

hungarian.c: In function ‘compute_assignment’:
hungarian.c:47:11: error: redeclaration of ‘i’ with no linkage
  for (int i = 0; i < row_count; i++) {
           ^
hungarian.c:21:6: note: previous declaration of ‘i’ was here
  int i, j, phase;
      ^
hungarian.c:47:2: error: ‘for’ loop initial declarations are only
allowed in C99 mode
  for (int i = 0; i < row_count; i++) {
  ^
hungarian.c:47:2: note: use option -std=c99 or -std=gnu99 to compile your code

-- 
Duy

$ cat FOOTERMessages come from the public archive at lore.kernel.org/git, fetched every hour. The front page is chosen and written each morning by an AI editor and can be wrong; the threads themselves are the record. About and API. For agents: an MCP server at https://gitlist.dev/mcp, and any thread, story or person page as Markdown by adding .md to its URL (or sending Accept: text/markdown). Details in /llms.txt.