*
   * <p>The {@link SortedSet#tailSet} documentation states that a subset of a subset throws an
   * {@link IllegalArgumentException} if passed a {@code fromElement} smaller than an earlier {@code
   * fromElement}. However, this method doesn't throw an exception in that situation, but instead
   * keeps the original {@code fromElement}.
   */
  @Override
  public ImmutableSortedSet<E> tailSet(E fromElement) {

  $("#confirmToDelete").on("show.bs.modal", function(event) {
    var button = $(event.relatedTarget),
        docId = button.data("docid"),
        title = button.data("title"),
        url = button.data("url");

    $(this)
      .find(".modal-body #delete-doc-title")
      .text(title);
    $(this)
      .find(".modal-body #delete-doc-url")
      .text(url);
    $(this)
      .find(".modal-footer input#docId")

@GwtCompatible
@NullMarked
public class HashBasedTableRowTest extends RowTests {
  public HashBasedTableRowTest() {
    super(false, true, true, true, true);
  }

  @Override
  Table<Character, String, Integer> makeTable() {
    return HashBasedTable.create();
  }

@GwtCompatible
@NullMarked
public class HashBasedTableColumnMapTest extends ColumnMapTests {
  public HashBasedTableColumnMapTest() {
    super(false, true, true, false);
  }

  @Override
  Table<Integer, String, Character> makeTable() {
    return HashBasedTable.create();
  }

@GwtCompatible
@NullMarked
public class HashBasedTableRowMapTest extends RowMapTests {
  public HashBasedTableRowMapTest() {
    super(false, true, true, true);
  }

  @Override
  Table<String, Integer, Character> makeTable() {
    return HashBasedTable.create();
  }

@GwtCompatible
@NullMarked
public class TreeBasedTableRowMapTest extends RowMapTests {
  public TreeBasedTableRowMapTest() {
    super(false, true, true, true);
  }

  @Override
  Table<String, Integer, Character> makeTable() {
    return TreeBasedTable.create();
  }

@GwtIncompatible // TODO(hhchan): ArrayTable
@NullUnmarked
public class ArrayTableRowMapTest extends RowMapTests {
  public ArrayTableRowMapTest() {
    super(true, false, false, false);
  }

  @Override
  Table<String, Integer, Character> makeTable() {
    return ArrayTable.create(asList("foo", "bar", "dog"), asList(1, 2, 3));
  }

  @Override
  protected Map<String, Map<Integer, Character>> makeEmptyMap() {

import java.io.IOException
import okio.Buffer
import okio.BufferedSink
import okio.BufferedSource
import okio.ByteString
import okio.ByteString.Companion.encodeUtf8
import okio.Options

/**
 * A decoded [mapping table] that can perform the [mapping step] of IDNA processing.
 *
 * This implementation is optimized for readability over efficiency.
 *
 * This implements non-transitional processing by preserving deviation characters.
 *

// First finds the first record ordered by primary key, matching given conditions conds
func (db *DB) First(dest interface{}, conds ...interface{}) (tx *DB) {
	tx = db.Limit(1).Order(clause.OrderByColumn{
		Column: clause.Column{Table: clause.CurrentTable, Name: clause.PrimaryKey},
	})
	if len(conds) > 0 {
		if exprs := tx.Statement.BuildCondition(conds[0], conds[1:]...); len(exprs) > 0 {
			tx.Statement.AddClause(clause.Where{Exprs: exprs})
		}

@GwtIncompatible // TODO(hhchan): ArrayTable
@NullUnmarked
public class ArrayTableRowMapTest extends RowMapTests {
  public ArrayTableRowMapTest() {
    super(true, false, false, false);
  }

  @Override
  Table<String, Integer, Character> makeTable() {
    return ArrayTable.create(asList("foo", "bar", "dog"), asList(1, 2, 3));
  }

  @Override
  protected Map<String, Map<Integer, Character>> makeEmptyMap() {