git/list[1] front-page[2] threads[3] people[4] search[5] about
 

Re: [EXPERIMENTAL PATCH] O(n) bisection algorithm

From
Jon Seymour <jon.seymour@gmail.com>
Date
Jun 30, 2005, 09:03 UTC
Message-ID
<2cfc4032050630020359c76147@mail.gmail.com>
In-Reply-To
<20050630081135.27577.qmail@blackcubes.dyndns.org>
BTW: just in case you are wondering what these variables are for and
why they and the associated code is there...
> +static struct commit_list * topological_order = NULL;
> +static struct commit_list ** t_o_tail = &topological_order;

They are not required. This was a remnant of a previous version that used the --merge-order code to obtain the topological order. Of course, the final submission will remove this redundant code.

jon.
Previous: Jon Seymour
Message 2 of 2 in “O(n) bisection algorithm”
  1. O(n) bisection algorithmJon Seymour, Jun 30, 2005
  2. Jon SeymourJun 30, 2005

Read the whole thread, see it on lore, or plain text.

$ 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.