Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 241 - 250 of 736 for called (0.04 seconds)

  1. android/guava/src/com/google/common/hash/AbstractStreamingHasher.java

          Java8Compatibility.position(buffer, buffer.limit());
        }
        return makeHash();
      }
    
      /**
       * Computes a hash code based on the data that have been provided to this hasher. This is called
       * after all chunks are handled with {@link #process} and any leftover bytes that did not make a
       * complete chunk are handled with {@link #processRemaining}.
       */
      protected abstract HashCode makeHash();
    
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Sat Dec 21 03:10:51 GMT 2024
    - 7.1K bytes
    - Click Count (0)
  2. LICENSE

    users of that server.  Therefore, public use of a modified version, on
    a publicly accessible server, gives the public access to the source
    code of the modified version.
    
      An older license, called the Affero General Public License and
    published by Affero, was designed to accomplish similar goals.  This is
    a different license, not a version of the Affero GPL, but Affero has
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Apr 23 18:58:53 GMT 2021
    - 33.7K bytes
    - Click Count (0)
  3. internal/config/config.go

    )
    
    // DefaultKVS - default kvs for all sub-systems
    var DefaultKVS = map[string]KVS{}
    
    // RegisterDefaultKVS - this function saves input kvsMap
    // globally, this should be called only once preferably
    // during `init()`.
    func RegisterDefaultKVS(kvsMap map[string]KVS) {
    	maps.Copy(DefaultKVS, kvsMap)
    }
    
    // HelpSubSysMap - help for all individual KVS for each sub-systems
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 37.7K bytes
    - Click Count (0)
  4. cmd/data-scanner.go

    	disksQuorum int
    
    	// If set updates will be sent regularly to this channel.
    	// Will not be closed when returned.
    	updates    chan<- dataUsageEntry
    	lastUpdate time.Time
    
    	// updateCurrentPath should be called whenever a new path is scanned.
    	updateCurrentPath func(string)
    }
    
    // Cache structure and compaction:
    //
    // A cache structure will be kept with a tree of usages.
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 45.5K bytes
    - Click Count (0)
  5. android/guava/src/com/google/common/cache/Cache.java

       * value. Otherwise, a call that passes one {@code loader} may return the result of another call
       * with a differently behaving {@code loader}. For example, a call that requests a short timeout
       * for an RPC may wait for a similar call that requests a long timeout, or a call by an
       * unprivileged user may return a resource accessible only to a privileged user making a similar
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 8.3K bytes
    - Click Count (0)
  6. architecture/platforms.md

    <!-- 
      -- Note: this file contains a generated diagram. Use `./gradlew :architectureDoc` to generate 
      -->
    
    # Gradle platform architecture
    
    Gradle is arranged into coarse-grained components called "architecture modules" and "platforms".
    See [ADR4](standards/0004-use-a-platform-architecture.md) for a definition of these terms.
    
    The diagram below shows the current set of architecture modules and platforms:
    
    Created: Wed Dec 31 11:36:14 GMT 2025
    - Last Modified: Thu May 02 06:42:46 GMT 2024
    - 5.4K bytes
    - Click Count (0)
  7. cmd/test-utils_test.go

    // Temp files created in default Tmp dir
    var globalTestTmpDir = os.TempDir()
    
    // reseed - returns a new seed every time the function is called.
    func reseed() uint32 {
    	return uint32(time.Now().UnixNano() + int64(os.Getpid()))
    }
    
    // nextSuffix - provides a new unique suffix every time the function is called.
    func nextSuffix() string {
    	randmu.Lock()
    	r := randN
    	// Initial seed required, generate one.
    	if r == 0 {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 77K bytes
    - Click Count (0)
  8. internal/ringbuffer/ring_buffer.go

    // If some data is available but not len(p) bytes, Read conventionally returns what is available instead of waiting for more.
    // When Read encounters an error or end-of-file condition after successfully reading n > 0 bytes, it returns the number of bytes read.
    // It may return the (non-nil) error from the same call or return the error (and n == 0) from a subsequent call.
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 13.3K bytes
    - Click Count (0)
  9. guava/src/com/google/common/util/concurrent/FuturesGetChecked.java

            }
            checkExceptionClassValidity(exceptionClass);
    
            /*
             * It's very unlikely that any loaded Futures class will see getChecked called with more
             * than a handful of exceptions. But it seems prudent to set a cap on how many we'll cache.
             * This avoids out-of-control memory consumption, and it keeps the cache from growing so
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Sat Aug 09 01:14:59 GMT 2025
    - 11.8K bytes
    - Click Count (0)
  10. guava-tests/test/com/google/common/cache/CacheLoadingTest.java

        }
      }
    
      /**
       * On a concurrent computation that returns null, all threads should get an
       * InvalidCacheLoadException, with the loader only called once. The result should not be cached (a
       * later request should call the loader again).
       */
      private static void testConcurrentLoadingNull(CacheBuilder<Object, Object> builder)
          throws InterruptedException {
    
        int count = 10;
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Sep 30 22:03:28 GMT 2025
    - 91.1K bytes
    - Click Count (0)
Back to Top