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

Re: [PATCH 03/10] sha1-array: provide oid_array_remove_if

From
Stefan Beller <sbeller@google.com>
Date
Aug 9, 2018, 17:25 UTC
Message-ID
<CAGZ79kYtKZJ0Dm0ejxrotnoaNERtR0J6=DMCgweCObdJr0K6-w@mail.gmail.com>
In-Reply-To
<CAN0heSqwGoFwn34nRp3i09ExnjDPSY8WD=81M9jN5OW-ccpiTg@mail.gmail.com>
On Thu, Aug 9, 2018 at 12:39 AM Martin Ågren <martin.agren@gmail.com> wrote:
Show 10 quoted lines
>
> On 9 August 2018 at 00:17, Stefan Beller <sbeller@google.com> wrote:
> > +int oid_array_remove_if(struct oid_array *array,
> > +                       for_each_oid_fn fn,
> > +                       void *data)
> > +{
> > +       int i, j;
> > +       char *to_remove = xcalloc(array->nr, sizeof(char));
>
> Do you really need this scratch space?
I don't think so, when we reorder the items while iterating over them.
I though reordering them later would be easier, but I am not sure anymore.
Show 38 quoted lines
>
> > +       /* No oid_array_sort() here! See the api-oid-array.txt docs! */
> > +
> > +       for (i = 0; i < array->nr; i++) {
> > +               int ret = fn(array->oid + i, data);
> > +               if (ret)
> > +                       to_remove[i] = 1;
> > +       }
> > +
> > +       i = 0, j = 0;
> > +       while (i < array->nr && j < array->nr) {
> > +               while (i < array->nr && !to_remove[i])
> > +                       i++;
> > +               /* i at first marked for deletion or out */
> > +               if (j < i)
> > +                       j = i;
> > +               while (j < array->nr && to_remove[j])
> > +                       j++;
> > +               /* j > i; j at first valid after first deletion range or out */
> > +               if (i < array->nr && j < array->nr)
> > +                       oidcpy(&array->oid[i], &array->oid[j]);
> > +               else if (i >= array->nr)
> > +                       assert(j >= array->nr);
> > +                       /* no pruning happened, keep original array->nr */
> > +               else if (j >= array->nr)
> > +                       array->nr = i;
> > +       }
> > +
> > +       free(to_remove);
> > +
> > +       return 0;
> > +}
>
> I can't entirely follow this index-fiddling, but then I haven't had my
> morning coffee yet, so please forgive me if this is nonsense. Would it
> suffice to let i point out where to place items (starting at the first
> item not to keep) and j where to take them from (i.e., the items to
> keep, after the initial run)?
I thought this is what happens, just after the actual loop of calls.
Show 5 quoted lines
> > +int oid_array_remove_if(struct oid_array *array,
> > +                       for_each_oid_fn fn,
> > +                       void *data);
>
> Maybe some documentation here, but this seems to be following suit. ;-)

Worth mentioning: the order is kept stable. (c.f. shrink_potential_moved_blocks in diff.c which also "compacts an array", but without stable order).

Thanks for the review. I'll try to rewrite this to be more legible.

Thanks, Stefan

Previous: Martin ÅgrenNext: Jeff King
Message 14 of 27 in “fetch: make sure submodule oids are fetched”
  1. 00/10 fetch: make sure submodule oids are fetchedStefan Beller, Aug 8, 2018
  2. 01/10 string_list: print_string_list to use trace_printfStefan Beller, Aug 8, 2018
  3. Junio C HamanoAug 9, 2018
  4. Stefan BellerAug 9, 2018
  5. 02/10 string-list.h: add string_list_pop function.Stefan Beller, Aug 8, 2018
  6. Martin ÅgrenAug 9, 2018
  7. Junio C HamanoAug 9, 2018
  8. Jeff KingAug 9, 2018
  9. Stefan BellerAug 9, 2018
  10. Jeff KingAug 9, 2018
  11. Stefan BellerAug 9, 2018
  12. 03/10 sha1-array: provide oid_array_remove_ifStefan Beller, Aug 8, 2018
  13. Martin ÅgrenAug 9, 2018
  14. Stefan BellerAug 9, 2018
  15. Jeff KingAug 9, 2018
  16. Junio C HamanoAug 9, 2018
  17. Junio C HamanoAug 9, 2018
  18. 04/10 submodule.c: convert submodule_move_head new argument to object idStefan Beller, Aug 8, 2018
  19. Junio C HamanoAug 9, 2018
  20. 05/10 submodule.c: fix indentationStefan Beller, Aug 8, 2018
  21. 06/10 submodule.c: sort changed_submodule_names before searching itStefan Beller, Aug 8, 2018
  22. 07/10 submodule: move global changed_submodule_names into fetch submodule structStefan Beller, Aug 8, 2018
  23. 08/10 submodule.c: do not copy around submodule listStefan Beller, Aug 8, 2018
  24. 09/10 submodule: fetch in submodules git directory instead of in worktreeStefan Beller, Aug 8, 2018
  25. 10/10 fetch: retry fetching submodules if sha1 were not fetchedStefan Beller, Aug 8, 2018
  26. Martin ÅgrenAug 9, 2018
  27. Stefan BellerAug 9, 2018

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.