Welcome to the Lounge

Cpichols wrote:

I do wish that JavaScript could handle associative arrays (not objects) in foreach loops where keys and values could be easily accessed for each item in the array

const data = [];

data['a'] = 200;
data['b'] = 300;

for (const datum in data) {
  console.info(`${datum}: ${data[datum]}`);
}

Cpichols wrote:

and so that it could be done recursively

for (record r = head; r; r = r.next) {

  initloop: {
    int iterationCount = 0;
    record trailer = null;
    int accumulated = 0;
  }
  ...
  if (++iterationCount > limit) break : GivingUp;
  ...
  if (r.key == desiredKey) break : RecordFound;
  ...
  trailer = r;
  accumulated += r.value;

  exitbreak (GivingUp): { 
    Console.WriteLine("Possible circular list: " + head.listname;
    Console.WriteLine("Giving up after " + iterationCount + " iterations");
  }

  exitbreak (RecordFound): {               // process r, with access to loop local variables, e.g. 
    if (trailer == null) head = r.next;
    else trailer.next = r.next;
    r.sumOfPreceding = accumulated; 
    // save r on disk 
  }

  exitloop: { 
   Console.Writeline(desiredKey + " not found among " + iterationCount + " records");
  }

  finally: { 
   <actions executed in loop context regardless of exit reason> 
  }
}

switch( x, y, z )
{
	case 1, 2, 3:
	break;
	etc.
}

typedef struct
{
  int  id;
  char name[20];
} myrecord_t;

myrecord_t * alloc_list(__bound__(0, 10000000) unsigned int size)
{
   /* size > 178956970 on 32-bit ===> overflow */
   return malloc(size * sizeof(myrecord_t));
}

void safecaller(__bound__(1, 100000) unsigned int size)
{
  /* Okay - [1-1000000] with-in [0, 10000000] bounds */
  myrecord_t * list = alloc_list(size);

  /* ... */
}

void badcaller(unsigned int size)
{
  /* Compile ERROR - default (32-bit) unsigned int not with-in [0, 10000000] bounds */
  myrecord_t * list = alloc_list(size);

  /* ... */
}

Early growth = BUD
Key          =    G
That is      =     IE

Bird = BUDGIE