Attention is currently required from: laforge, fixeria, daniel.

1 comment:

Patchset:
- Patch Set #1:
  I'm not sure this assumption is correct. The way to go, imho, would be to use a hashtable or rbtree (based on a stack allocated pool of structs to store data), with key=group_name, so that we keep track over the groups already printed.
  If done this way it's pretty efficient in memory use as well as allocation (no heap allocation occurs).
  I did this recently in open5gs to track repeated IEs in TLV, see https://github.com/open5gs/open5gs/pull/1351/commits/1a518bff735b6c34639df4b2f81d6c18a21bb970

To view, visit change 27409. To unsubscribe, or for help writing mail filters, visit settings.