return false
	}
	var pre sparseEntry
	for _, cur := range sp {
		switch {
		case cur.Offset < 0 || cur.Length < 0:
			return false // Negative values are never okay
		case cur.Offset > math.MaxInt64-cur.Length:
			return false // Integer overflow with large length
		case cur.endOffset() > size:
			return false // Region extends beyond the actual size
		case pre.endOffset() > cur.Offset:

            case -1:
            case '\n':
                eol = true;
                break;
            case '\r':
                eol = true;
                final long cur = fp;
                if (read() != '\n') {
                    fp = cur;
                }
                break;
            default:
                input.append((char) c);
                break;
            }
        }

            this.micRequired = true;
            this.mic = new byte[16];
            int curFlags = 0;
            final AvFlags cur = (AvFlags) AvPairs.get(serverAvPairs, AvPair.MsvAvFlags);
            if (cur != null) {
                curFlags = cur.getFlags();
            }
            curFlags |= 0x2; // MAC present
            AvPairs.replace(serverAvPairs, new AvFlags(curFlags));
        }

            case '\n':
                eol = true;
                break;
            case '\r':
                eol = true;
                final long cur = this.fp;
                if (read() != '\n') {
                    this.fp = cur;
                }
                break;
            default:
                input.append((char) c);
                break;
            }
        }

				t.Fatalf("Preload user %v pets not ordered correctly, last %v, cur %v", result.Name, result.Pets[i-1], result.Pets[i])
			}
		}
		for i := 1; i < len(result.Pets); i++ {
			if result.Pets[i-1].Name > result.Pets[i].Name {
				t.Fatalf("Preload user %v friends not ordered correctly, last %v, cur %v", result.Name, result.Pets[i-1], result.Pets[i])
			}
		}
	}
}

    }
    checkElementsNotNull(contents, n);
    sort(contents, 0, n, comparator);
    int uniques = 1;
    for (int i = 1; i < n; i++) {
      E cur = contents[i];
      E prev = contents[uniques - 1];
      if (comparator.compare(cur, prev) != 0) {
        contents[uniques++] = cur;
      }
    }
    Arrays.fill(contents, uniques, n, null);
    if (uniques < contents.length / 2) {