}

    @GwtIncompatible @J2ktIncompatible private static final long serialVersionUID = 0;
  }

  /**
   * Returns an unmodifiable view of the specified row-sorted table. This method allows modules to
   * provide users with "read-only" access to internal tables. Query operations on the returned
   * table "read through" to the specified table, and attempts to modify the returned table, whether

     *
     * <p>This method performs a paginated search through all data configurations,
     * applying any search filters specified in the pager. The results are sorted
     * by sort order and name.</p>
     *
     * @param dataConfigPager the pager containing search criteria and pagination settings
     * @return a list of DataConfig entities matching the search criteria

// provided when decrypting an encrypted DEK.
type Context map[string]string

// MarshalText returns a canonical text representation of
// the Context.

// MarshalText sorts the context keys and writes the sorted
// key-value pairs as canonical JSON object. The sort order
// is based on the un-escaped keys. It never returns an error.
func (c Context) MarshalText() ([]byte, error) {
	if len(c) == 0 {
		return []byte{'{', '}'}, nil

    return absl::OkStatus();
  }
  string msg = absl::StrCat(
      "No tracing engine factory has been registered with the key '", name,
      "' (available: ");
  // Ensure deterministic (sorted) order in the error message
  std::set<string> factories_sorted;
  for (const auto& factory : GetFactories())
    factories_sorted.insert(factory.first);
  const char* comma = "";

        private final Predicate<? super P> filter;

        private static final List<BuilderProblem.Severity> REVERSED_ORDER = Arrays.stream(
                        BuilderProblem.Severity.values())
                .sorted(Comparator.reverseOrder())
                .toList();

        private Impl(int maxCountLimit, Predicate<? super P> filter) {
            if (maxCountLimit < 0) {

/**
 * A generalized interval on any ordering, for internal use. Supports {@code null}. Unlike {@link
 * Range}, this allows the use of an arbitrary comparator. This is designed for use in the
 * implementation of subcollections of sorted collection types.
 *
 * <p>Whenever possible, use {@code Range} instead, which is better supported.
 *
 * @author Louis Wasserman
 */
@GwtCompatible

import com.google.common.annotations.J2ktIncompatible;
import com.google.errorprone.annotations.DoNotCall;
import java.util.Collections;
import java.util.NoSuchElementException;
import java.util.Set;

/**
 * A sorted set of contiguous values in a given {@link DiscreteDomain}. Example:
 *
 * {@snippet :
 * ContiguousSet.create(Range.closed(5, 42), DiscreteDomain.integers())
 * }
 *

        String[] keys = entrySet.stream().map(Map.Entry::getKey).toArray(String[]::new);

        boolean langFirst = "lang".equals(keys[0]);
        assertTrue("lang should be first or sorted normally", langFirst || Arrays.asList(keys).contains("lang"));

        assertTrue(Arrays.asList(keys).contains("apple"));
        assertTrue(Arrays.asList(keys).contains("banana"));

            when (it) {
                TargetRuntime.CLIENT -> "client = true"
                TargetRuntime.DAEMON -> "daemon = true"
                TargetRuntime.WORKER -> "worker = true"
            }
        }.sorted()

        val blockContents = listOf("// Auto-generated by `:checkTargetRuntimes --fix`") + newTargetRuntimes

        val newLines = lines.subList(0, start + 1) +
            blockContents.map { " ".repeat(8) + it } +

pkg slices, func SortedFunc[$0 interface{}](iter.Seq[$0], func($0, $0) int) []$0 #61899
pkg slices, func SortedStableFunc[$0 interface{}](iter.Seq[$0], func($0, $0) int) []$0 #61899
pkg slices, func Sorted[$0 cmp.Ordered](iter.Seq[$0]) []$0 #61899
pkg slices, func Values[$0 interface{ ~[]$1 }, $1 interface{}]($0) iter.Seq[$1] #61899
pkg structs, type HostLayout struct #66408
pkg sync, method (*Map) Clear() #61696