- Sort Score
- Result 10 results
- Languages All
Results 121 - 130 of 437 for previous (0.05 sec)
- 
				
				cmd/config-migrate.go// root credentials set via environment variable. globalActiveCred = cfg.Credential } // Init compression config. For future migration, Compression config needs to be copied over from previous version. switch cfg.Version { case "29": // V29 -> V30 cfg.Compression.Enabled = false cfg.Compression.Extensions = strings.Split(compress.DefaultExtensions, config.ValueSeparator)Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 5.4K bytes - Viewed (0)
- 
				
				cmd/config.go"github.com/minio/minio/internal/kms" ) const ( minioConfigPrefix = "config" minioConfigBucket = minioMetaBucket + SlashSeparator + minioConfigPrefix kvPrefix = ".kv" // Captures all the previous SetKV operations and allows rollback. minioConfigHistoryPrefix = minioConfigPrefix + "/history" // MinIO configuration file. minioConfigFile = "config.json" ) Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 5.9K bytes - Viewed (0)
- 
				
				android/guava/src/com/google/common/collect/BiMap.java* * @param key the key with which the specified value is to be associated * @param value the value to be associated with the specified key * @return the value that was previously associated with the key, or {@code null} if there was no * previous entry. (If the bimap contains null values, then {@code forcePut}, like {@code * put}, returns {@code null} both if the key is absent and if it is present with a null * value.)Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Aug 06 17:32:30 UTC 2025 - 4.2K bytes - Viewed (0)
- 
				
				guava/src/com/google/common/collect/BiMap.java* * @param key the key with which the specified value is to be associated * @param value the value to be associated with the specified key * @return the value that was previously associated with the key, or {@code null} if there was no * previous entry. (If the bimap contains null values, then {@code forcePut}, like {@code * put}, returns {@code null} both if the key is absent and if it is present with a null * value.)Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Aug 06 17:32:30 UTC 2025 - 4.2K bytes - Viewed (0)
- 
				
				src/main/java/org/codelibs/fess/dict/DictionaryFile.java* @return the total page count */ public int getAllPageCount() { return allPageCount; } /** * Checks if a previous page exists. * * @return true if there is a previous page, false otherwise */ public boolean isExistPrePage() { return currentPageNumber != 1; } /**Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Tue Aug 19 14:09:36 UTC 2025 - 11.2K bytes - Viewed (0)
- 
				
				guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.javafactorials[i] = RANDOM_SOURCE.nextInt(factorialBound); slowFactorials[i] = RANDOM_SOURCE.nextInt(factorialBound); binomials[i] = RANDOM_SOURCE.nextInt(factorials[i] + 1); } } /** Previous version of BigIntegerMath.factorial, kept for timing purposes. */ private static BigInteger oldSlowFactorial(int n) { if (n <= 20) { return BigInteger.valueOf(LongMath.factorial(n)); } else { Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 3.5K bytes - Viewed (0)
- 
				
				docs/en/docs/tutorial/index.md# Tutorial - User Guide { #tutorial-user-guide } This tutorial shows you how to use **FastAPI** with most of its features, step by step. Each section gradually builds on the previous ones, but it's structured to separate topics, so that you can go directly to any specific one to solve your specific API needs. It is also built to work as a future reference so you can come back and see exactly what you need. ## Run the code { #run-the-code }Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 5.1K bytes - Viewed (0)
- 
				
				android/guava-tests/test/com/google/common/util/concurrent/ExecutionListTest.javaokayToRun.countDown(); thread1.join(); thread2.join(); assertEquals(1, runCalled.get()); } public void testAddAfterRun() throws Exception { // Run the previous test testRunOnPopulatedList(); // If it passed, then verify an Add will be executed without calling run CountDownLatch countDownLatch = new CountDownLatch(1); Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Jul 11 18:52:30 UTC 2025 - 4.7K bytes - Viewed (0)
- 
				
				internal/lru/lru.go} // Entry is an LRU Entry type Entry[K comparable, V any] struct { // Next and previous pointers in the doubly-linked list of elements. // To simplify the implementation, internally a list l is implemented // as a ring, such that &l.root is both the next element of the last // list element (l.Back()) and the previous element of the first list // element (l.Front()). next, prev *Entry[K, V] Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Fri Apr 25 08:22:26 UTC 2025 - 12.5K bytes - Viewed (0)
- 
				
				CITATION.cffwithin a machine across multiple computational devices, including multicore CPUs, general purpose GPUs, and custom-designed ASICs known as Tensor Processing Units (TPUs). This architecture gives flexibility to the application developer, whereas in previous “parameter server” designs the management of shared state is built into the system, TensorFlow enables developers to experiment with novel optimizations and training algorithms. TensorFlow supports a variety of applications, with a focus on training... Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Mon Sep 06 15:26:23 UTC 2021 - 3.5K bytes - Viewed (0)