Sebastián Ramírez <******@****.***> 1728247014 +0200

Sebastián Ramírez <******@****.***> 1728247014 +0200

Sebastián Ramírez <******@****.***> 1728247014 +0200

Sebastián Ramírez <******@****.***> 1728247014 +0200

Guillaume Nodet <******@****.***> 1729859506 +0200

  @Override
  public UnmodifiableIterator<C> descendingIterator() {
    return new AbstractSequentialIterator<C>(last()) {
      final C first = first();

      @Override
      @CheckForNull
      protected C computeNext(C previous) {
        return equalsOrThrow(previous, first) ? null : domain.previous(previous);
      }
    };
  }

 * offering expected O(n + k log k) performance (worst case O(n log k)) for n calls to {@link
 * #offer} and a call to {@link #topK}, with O(k) memory. In comparison, quickselect has the same
 * asymptotics but requires O(n) memory, and a {@code PriorityQueue} implementation takes O(n log
 * k). In benchmarks, this implementation performs at least as well as either implementation, and
 * degrades more gracefully for worst-case input.
 *

		t.Fatalf("Failed to commit, got error %v", err)
	}

	if err := DB.First(&User{}, "name = ?", user.Name).Error; err != nil {
		t.Fatalf("Should find saved record")
	}

	if err := DB.First(&User{}, "name = ?", user1.Name).Error; err == nil {
		t.Fatalf("Should not find rollbacked record")
	}

	if err := DB.First(&User{}, "name = ?", user2.Name).Error; err != nil {
		t.Fatalf("Should find saved record")
	}

  val android5 = sslLabsClients.first { it.userAgent == "Android" && it.version == "5.0.0" }
  val android9 = sslLabsClients.first { it.userAgent == "Android" && it.version == "9.0" }
  val chrome33 = sslLabsClients.first { it.userAgent == "Chrome" && it.version == "33" }
  val chrome57 = sslLabsClients.first { it.userAgent == "Chrome" && it.version == "57" }
  val chrome80 = sslLabsClients.first { it.userAgent == "Chrome" && it.version == "80" }

    int len = sequence.length();
    int first;
    int last;

    for (first = 0; first < len; first++) {
      if (!matches(sequence.charAt(first))) {
        break;
      }
    }
    for (last = len - 1; last > first; last--) {
      if (!matches(sequence.charAt(last))) {
        break;
      }
    }

    return sequence.subSequence(first, last + 1).toString();
  }

  /**