- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 31 for Level0s (0.05 seconds)
-
tests/test_include_router_defaults_overrides.py
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Sun Feb 08 10:18:38 GMT 2026 - 385.6K bytes - Click Count (0) -
scripts/tests/test_translation_fixer/test_header_permalinks/test_header_level_mismatch.py
).read_text("utf-8") assert fixed_content == expected_content # Translated doc remains unchanged assert "Error processing docs/lang/docs/doc.md" in result.output assert ( "Header levels do not match between document and original document" " (found #, expected ##) for header №2 in line 5" ) in result.output @pytest.mark.parametrize( "copy_test_files",
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Sat Jan 10 22:43:44 GMT 2026 - 2K bytes - Click Count (0) -
android/guava/src/com/google/common/net/InternetDomainName.java
* Returns the ancestor of the current domain at the given number of levels "higher" (rightward) * in the subdomain list. The number of levels must be non-negative, and less than {@code N-1}, * where {@code N} is the number of parts in the domain. * * <p>TODO: Reasonable candidate for addition to public API. */ private InternetDomainName ancestor(int levels) {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Mar 03 21:21:59 GMT 2026 - 26.2K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
// optimistically fill index position with elements from lower levels, // moving the hole down. In most cases this reduces the number of // comparisons with toTrickle, but in some cases we will need to bubble it // all the way up again. int vacated = heap.fillHoleAt(index); // Try to see if toTrickle can be bubbled up min levels. int bubbledTo = heap.bubbleUpAlternatingLevels(vacated, toTrickle);Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 13:11:08 GMT 2026 - 34K bytes - Click Count (0) -
guava/src/com/google/common/collect/MinMaxPriorityQueue.java
// optimistically fill index position with elements from lower levels, // moving the hole down. In most cases this reduces the number of // comparisons with toTrickle, but in some cases we will need to bubble it // all the way up again. int vacated = heap.fillHoleAt(index); // Try to see if toTrickle can be bubbled up min levels. int bubbledTo = heap.bubbleUpAlternatingLevels(vacated, toTrickle);Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 13:11:08 GMT 2026 - 34K bytes - Click Count (0) -
docs/en/docs/management.md
## Team There's a team of people that help manage and maintain the project. 😎 They have different levels of permissions and [specific instructions](./management-tasks.md). Some of the tasks they can perform include: * Adding labels to PRs. * Editing PR titles. * Adding commits on top of PRs to tweak them.
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 05 18:13:19 GMT 2026 - 1.5K bytes - Click Count (0) -
src/test/java/org/codelibs/fess/exception/ContainerNotAvailableExceptionTest.java
assertEquals("anotherComponent", exception3.getComponentName()); } @Test public void test_exceptionChaining() { // Test exception chaining with multiple levels Exception rootCause = new Exception("Root cause"); RuntimeException middleCause = new RuntimeException("Middle cause", rootCause);
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sun Jan 11 08:43:05 GMT 2026 - 10.1K bytes - Click Count (0) -
src/test/java/org/codelibs/fess/exception/FessSystemExceptionTest.java
// Stack trace should be empty assertEquals(0, exception.getStackTrace().length); } @Test public void test_exceptionChaining() { // Test exception chaining with multiple levels Exception rootCause = new Exception("Root cause"); RuntimeException middleCause = new RuntimeException("Middle cause", rootCause);Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sun Jan 11 08:43:05 GMT 2026 - 7.6K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* <ul> * <li>2 levels: average of 64ns per lock()/unlock() * <li>3 levels: average of 77ns per lock()/unlock() * <li>4 levels: average of 99ns per lock()/unlock() * <li>5 levels: average of 103ns per lock()/unlock() * <li>10 levels: average of 184ns per lock()/unlock() * <li>20 levels: average of 393ns per lock()/unlock() * </ul> * </ul>
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 36K bytes - Click Count (0) -
build-logic/binary-compatibility/src/main/groovy/gradlebuild.binary-compatibility.gradle
.replaceAll('###', '.*?') } } static String writeFilterPreset(Project project) { def preset = project.providers.gradleProperty('bin.cmp.report.severity.filter').getOrElse('All levels') return """<input id="filter-preset" type="hidden" value="$preset" />"""
Created: Wed Apr 01 11:36:16 GMT 2026 - Last Modified: Tue Dec 30 10:14:25 GMT 2025 - 8.9K bytes - Click Count (0)