Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 171 - 180 of 252 for pre (0.01 seconds)

  1. internal/hash/reader.go

    }
    
    // Size returns the absolute number of bytes the Reader
    // will return during reading. It returns -1 for unlimited
    // data.
    func (r *Reader) Size() int64 { return r.size }
    
    // ActualSize returns the pre-modified size of the object.
    // DecompressedSize - For compressed objects.
    func (r *Reader) ActualSize() int64 { return r.actualSize }
    
    // ETag returns the ETag computed by an underlying etag.Tagger.
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Wed Jun 25 15:08:54 GMT 2025
    - 11.8K bytes
    - Click Count (0)
  2. build-logic/cleanup/src/test/groovy/gradlebuild/cleanup/services/LeakingProcessKillPatternTest.groovy

            (line =~ KillLeakingJavaProcesses.generateLeakingProcessKillPattern(projectDir)).find()
        }
    
        def "matches google-chrome-for-testing"() {
            def line = '3723579 /usr/bin/google-chrome-for-testing --allow-pre-commit-input --disable-background-networking --disable-client-side-phishing-detection --disable-default-apps --disable-gpu --disable-hang-monitor --disable-popup-blocking --disab'
    
            def projectDir = "/whatever"
    
    Created: Wed Dec 31 11:36:14 GMT 2025
    - Last Modified: Fri Jul 12 03:42:46 GMT 2024
    - 14.8K bytes
    - Click Count (0)
  3. guava/src/com/google/common/collect/CompactHashMap.java

       * the "next" pointer (pointing to the next entry in the bucket chain), which will always be less
       * than or equal to the hashtable mask.
       *
       * <pre>
       * hash  = aaaaaaaa
       * mask  = 00000fff
       * next  = 00000bbb
       * entry = aaaaabbb
       * </pre>
       *
       * <p>The pointers in [size(), entries.length) are all "null" (UNSET).
       */
      @VisibleForTesting transient int @Nullable [] entries;
    
      /**
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Jul 08 18:32:10 GMT 2025
    - 39.6K bytes
    - Click Count (0)
  4. cmd/metacache-server-pool.go

    		return entries, err
    	}
    
    	// Marker points to before the prefix, just ignore it.
    	if o.Marker < o.Prefix {
    		o.Marker = ""
    	}
    
    	// Marker is set validate pre-condition.
    	if o.Marker != "" && o.Prefix != "" {
    		// Marker not common with prefix is not implemented. Send an empty response
    		if !HasPrefix(o.Marker, o.Prefix) {
    			return entries, io.EOF
    		}
    	}
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 12.9K bytes
    - Click Count (0)
  5. internal/logger/logger.go

    func RegisterError(f func(string, error, bool) string) {
    	errorFmtFunc = f
    }
    
    // uniq swaps away duplicate elements in data, returning the size of the
    // unique set. data is expected to be pre-sorted, and the resulting set in
    // the range [0:size] will remain in sorted order. Uniq, following a
    // sort.Sort call, can be used to prepare arbitrary inputs for use as sets.
    func uniq(data sort.Interface) (size int) {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 12.4K bytes
    - Click Count (0)
  6. docs/en/docs/deployment/docker.md

    Docker has been one of the main tools to create and manage **container images** and **containers**.
    
    And there's a public <a href="https://hub.docker.com/" class="external-link" target="_blank">Docker Hub</a> with pre-made **official container images** for many tools, environments, databases, and applications.
    
    For example, there's an official <a href="https://hub.docker.com/_/python" class="external-link" target="_blank">Python Image</a>.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sat Sep 20 12:58:04 GMT 2025
    - 29.5K bytes
    - Click Count (1)
  7. cmd/utils.go

    	}
    	return accumulator
    }
    
    // Suffix returns the longest common suffix of the provided strings
    func lcpSuffix(strs []string) string {
    	return lcp(strs, false)
    }
    
    func lcp(strs []string, pre bool) string {
    	// short-circuit empty list
    	if len(strs) == 0 {
    		return ""
    	}
    	xfix := strs[0]
    	// short-circuit single-element list
    	if len(strs) == 1 {
    		return xfix
    	}
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 33K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/primitives/UnsignedInts.java

       */
      public static String join(String separator, int... array) {
        checkNotNull(separator);
        if (array.length == 0) {
          return "";
        }
    
        // For pre-sizing a builder, just get the right order of magnitude
        StringBuilder builder = new StringBuilder(array.length * 5);
        builder.append(toString(array[0]));
        for (int i = 1; i < array.length; i++) {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Sun Feb 09 16:22:33 GMT 2025
    - 13.8K bytes
    - Click Count (0)
  9. scripts/docs.py

        if not (match_start and match_end):
            raise RuntimeError("Couldn't auto-generate sponsors section")
        if not match_pre:
            raise RuntimeError("Couldn't find pre section (<style>) in index.md")
        frontmatter_end = match_pre.end()
        pre_end = match_start.end()
        post_start = match_end.start()
        template = Template(index_sponsors_template)
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sun Dec 21 17:40:17 GMT 2025
    - 16.9K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/primitives/UnsignedLongs.java

       */
      public static String join(String separator, long... array) {
        checkNotNull(separator);
        if (array.length == 0) {
          return "";
        }
    
        // For pre-sizing a builder, just get the right order of magnitude
        StringBuilder builder = new StringBuilder(array.length * 5);
        builder.append(toString(array[0]));
        for (int i = 1; i < array.length; i++) {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Aug 11 19:31:30 GMT 2025
    - 17.8K bytes
    - Click Count (0)
Back to Top