// Figure out largest value of total_drives_in_erasure_set which results
	// in least number of total_drives/total_drives_erasure_set ratio.
	prevD := divisibleSize / setCounts[0]
	for _, cnt := range setCounts {
		if divisibleSize%cnt == 0 {
			d := divisibleSize / cnt
			if d <= prevD {
				prevD = d
				setSize = cnt
			}
		}
	}
	return setSize
}

// possibleSetCountsWithSymmetry returns symmetrical setCounts based on the

			healing++
			if inclHealing {
				healingDisks = append(healingDisks, disks[i])
				healingInfos = append(healingInfos, infos[i])
			}
			continue
		}

		if !info.Scanning {
			newDisks = append(newDisks, disks[i])
			newInfos = append(newInfos, infos[i])
		} else {
			scanningDisks = append(scanningDisks, disks[i])
			scanningInfos = append(scanningInfos, infos[i])
		}
	}

        json.append("{");
        json.append("\"timestamp\":\"").append(escapeJson(entry.timestamp.toString())).append("\",");
        json.append("\"eventType\":\"").append(entry.eventType.name()).append("\",");
        json.append("\"severity\":\"").append(entry.severity.name()).append("\",");
        json.append("\"message\":\"").append(escapeJson(entry.message)).append("\"");

        if (!entry.context.isEmpty()) {

		case HasOne:
			schema.Relationships.HasOne = append(schema.Relationships.HasOne, relation)
		case HasMany:
			schema.Relationships.HasMany = append(schema.Relationships.HasMany, relation)
		case BelongsTo:
			schema.Relationships.BelongsTo = append(schema.Relationships.BelongsTo, relation)
		case Many2Many:
			schema.Relationships.Many2Many = append(schema.Relationships.Many2Many, relation)
		}
	}

        monitorTarget.append(buf, "key1", () -> "value1");
        buf.append(",");
        monitorTarget.append(buf, "key2", () -> 123);
        buf.append(",");
        monitorTarget.append(buf, "key3", () -> null);

        assertEquals("\"key1\":\"value1\",\"key2\":123,\"key3\":null", buf.toString());
    }

    // Test append with empty string
    public void test_append_emptyString() {

        StringBuilder sb = new StringBuilder();
        sb.append("SmbOperationException{");
        sb.append("errorCode=").append(errorCode);
        sb.append(", category=").append(errorCode.getCategory());
        sb.append(", retryable=").append(isRetryable());
        sb.append(", attempt=").append(attemptNumber);
        sb.append(", operation='").append(operationName).append('\'');

        if (ntStatus != 0) {

				if curIdx := getRIndex(sorted, c.name); curIdx == -1 {
					// if before callback already sorted, append current callback just after it
					sorted = append(sorted[:sortedIdx], append([]string{c.name}, sorted[sortedIdx:]...)...)
				} else if curIdx > sortedIdx {
					return fmt.Errorf("conflicting callback %s with before %s", c.name, c.before)
				}
			} else if idx := getRIndex(names, c.before); idx != -1 {
				// if before callback exists

                .append(",ntlmsspFlags=0x")
                .append(Hexdump.toHexString(this.ntlmsspFlags, 8))
                .append(",workstation=")
                .append(this.workstation)
                .append(",isEstablished=")
                .append(this.isEstablished)
                .append(",state=")
                .append(this.state)

        StringBuilder sb = new StringBuilder();
        sb.append(getClass().getSimpleName());
        sb.append("[code=").append(errorCode);
        sb.append(", severity=").append(severity);
        sb.append(", category=").append(category);
        sb.append(", message=").append(getMessage());

        if (recoveryHint != null) {
            sb.append(", hint=").append(recoveryHint);
        }

      logger.log(
        buildString {
          append("<-- ${response.code}")
          if (response.message.isNotEmpty()) append(" ${response.message}")
          append(" ${redactUrl(response.request.url)} (${tookMs}ms")
          if (!logHeaders) append(", $bodySize body")
          append(")")
        },
      )

      if (logHeaders) {
        val headers = response.headers