Lines Matching refs:entries

224 // empty strings to fill up unused entries.
1125 // For boxed Strings, we have to remove the 0-n indexed entries,
1225 // Count the number of consecutive entries.
1446 // Calculate the total length of all output entries and the individual max
1447 // entries length of all output entries. We have to remove colors first,
1457 // in-between two entries.
1459 // Check if at least three entries fit next to each other and prevent grouping
1460 // of arrays that contains entries of very different length (i.e., if a single
1461 // entry is longer than 1/5 of all other entries combined). Otherwise the
1462 // space in-between small entries would be enormous.
1475 // The added bias increases the columns for short entries.
1513 // Each iteration creates a single line of grouped entries.
1515 // The last lines may contain less entries than columns.
1686 // Arrays can only have up to 2^32 - 1 entries
1813 function formatSetIterInner(ctx, recurseTimes, entries, state) {
1815 const maxLength = MathMin(maxArrayLength, entries.length);
1819 output[i] = formatValue(ctx, entries[i], recurseTimes);
1823 // Sort all entries to have a halfway reliable output (if more entries than
1828 const remaining = entries.length - maxLength;
1836 function formatMapIterInner(ctx, recurseTimes, entries, state) {
1839 const len = entries.length / 2;
1849 `${formatValue(ctx, entries[pos], recurseTimes)} => ${formatValue(ctx, entries[pos + 1], recurseTimes)}`;
1851 // Sort all entries to have a halfway reliable output (if more entries than
1860 formatValue(ctx, entries[pos], recurseTimes),
1861 formatValue(ctx, entries[pos + 1], recurseTimes),
1879 const entries = previewEntries(value);
1880 return formatSetIterInner(ctx, recurseTimes, entries, kWeak);
1884 const entries = previewEntries(value);
1885 return formatMapIterInner(ctx, recurseTimes, entries, kWeak);
1889 const { 0: entries, 1: isKeyValue } = previewEntries(value, true);
1893 return formatMapIterInner(ctx, recurseTimes, entries, kMapEntries);
1896 return formatSetIterInner(ctx, recurseTimes, entries, kIterator);
2018 // prevent lining up the entries on a single line.
2019 const entries = output.length;
2021 // separate entries.
2022 if (extrasType === kArrayExtrasType && entries > 6) {
2036 // Consolidate all entries of the local most inner depth up to
2040 entries === output.length) {
2041 // Line up all entries on a single line in case the entries do not
2060 // Line up all entries on a single line in case the entries do not exceed