Extremem/src/main/java/com/amazon/corretto/benchmark/extremem/Arraylet.java [41:63]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      int num_tiers = 1;
      // At bottom tier of fan-out structure, each entry spans this
      // many ArrayLet elements.
      int span_of_entry = max_length;
      while (span_of_entry * max_length < length) {
        num_tiers++;
        span_of_entry *= max_length;
      }
      this.num_tiers = num_tiers;
      this.top_entry_span = span_of_entry;

      int[] counts = new int[num_tiers];
      Object[][] arrays = new Object[num_tiers][];

      memory.accumulate(LifeSpan.Ephemeral, MemoryFlavor.ArrayObject, Grow, 2);
      memory.accumulate(LifeSpan.Ephemeral, MemoryFlavor.ArrayRSB,
                        Grow, num_tiers * Util.SizeOfInt);
      memory.accumulate(LifeSpan.Ephemeral, MemoryFlavor.ArrayReference,
                        Grow, num_tiers);

      for (int i = 0; i < num_tiers; i++) {
        arrays[i] = new Object[max_length];
        this.total_arrays++;
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -



Extremem/src/main/java/com/amazon/corretto/benchmark/extremem/ArrayletOflong.java [44:66]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      int num_tiers = 1;
      // At bottom tier of fan-out structure, each entry spans this
      // many ArrayLet elements.
      int span_of_entry = max_length;
      while (span_of_entry * max_length < length) {
        num_tiers++;
        span_of_entry *= max_length;
      }
      this.num_tiers = num_tiers;
      this.top_entry_span = span_of_entry;

      int[] counts = new int[num_tiers];
      Object[][] arrays = new Object[num_tiers][];

      memory.accumulate(LifeSpan.Ephemeral, MemoryFlavor.ArrayObject, Grow, 2);
      memory.accumulate(LifeSpan.Ephemeral, MemoryFlavor.ArrayRSB,
                        Grow, num_tiers * Util.SizeOfInt);
      memory.accumulate(LifeSpan.Ephemeral, MemoryFlavor.ArrayReference,
                        Grow, num_tiers);

      for (int i = 0; i < num_tiers; i++) {
        arrays[i] = new Object[max_length];
        this.total_arrays++;
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -