Search Options

Results per page
Sort
Preferred Languages
Advance

Results 241 - 250 of 291 for hatten (0.1 sec)

  1. src/bufio/bufio.go

    	if b.err != nil {
    		return 0, b.err
    	}
    	n := b.Available()
    	if n < utf8.UTFMax {
    		if b.Flush(); b.err != nil {
    			return 0, b.err
    		}
    		n = b.Available()
    		if n < utf8.UTFMax {
    			// Can only happen if buffer is silly small.
    			return b.WriteString(string(r))
    		}
    	}
    	size = utf8.EncodeRune(b.buf[b.n:], r)
    	b.n += size
    	return size, nil
    }
    
    // WriteString writes a string.
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu Oct 12 14:39:08 UTC 2023
    - 21.8K bytes
    - Viewed (0)
  2. istioctl/pkg/proxyconfig/proxyconfig.go

    				} else {
    					_, _ = fmt.Fprintf(c.OutOrStdout(), "%v.%v:\n%v", podName, podNamespace, resp)
    				}
    			}
    			if err := multierror.Flatten(errs.ErrorOrNil()); err != nil {
    				return err
    			}
    			return nil
    		},
    		ValidArgsFunction: completion.ValidPodsNameArgs(ctx),
    	}
    
    	levelListString := fmt.Sprintf("[%s, %s, %s, %s, %s, %s, %s]",
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Thu Oct 24 15:53:49 UTC 2024
    - 50.6K bytes
    - Viewed (0)
  3. guava/src/com/google/common/collect/Range.java

       *   <li>{@code [3..6]} encloses {@code [4..4)} (even though the latter is empty)
       *   <li>{@code (3..6]} does not enclose {@code [3..6]}
       *   <li>{@code [4..5]} does not enclose {@code (3..6)} (even though it contains every value
       *       contained by the latter range)
       *   <li>{@code [3..6]} does not enclose {@code (1..1]} (even though it contains every value
       *       contained by the latter range)
       * </ul>
       *
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 16 17:21:56 UTC 2024
    - 27.8K bytes
    - Viewed (0)
  4. src/archive/zip/reader.go

    		if f.ModifiedTime != 0 || f.ModifiedDate != 0 {
    			f.Modified = modified.In(timeZone(msdosModified.Sub(modified)))
    		}
    	}
    
    	// Assume that uncompressed size 2³²-1 could plausibly happen in
    	// an old zip32 file that was sharding inputs into the largest chunks
    	// possible (or is just malicious; search the web for 42.zip).
    	// If needUSize is true still, it means we didn't see a zip64 extension.
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Sat Aug 03 01:05:29 UTC 2024
    - 28.1K bytes
    - Viewed (0)
  5. cmd/bucket-lifecycle.go

    		return nil
    	}
    	workers := *w
    	return workers[h%uint64(len(workers))]
    }
    
    func (es *expiryState) ResizeWorkers(n int) {
    	if n == 0 {
    		n = 100
    	}
    
    	// Lock to avoid multiple resizes to happen at the same time.
    	es.mu.Lock()
    	defer es.mu.Unlock()
    	var workers []chan expiryOp
    	if v := es.workers.Load(); v != nil {
    		// Copy to new array.
    		workers = append(workers, *v...)
    	}
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Oct 23 15:35:37 UTC 2024
    - 33.7K bytes
    - Viewed (0)
  6. cmd/metacache-set.go

    	// Remove leading and trailing slashes.
    	o.FilterPrefix = strings.Trim(o.FilterPrefix, slashSeparator)
    
    	if strings.Contains(o.FilterPrefix, slashSeparator) {
    		// Sanity check, should not happen.
    		o.FilterPrefix = ""
    	}
    }
    
    // filter will apply the options and return the number of objects requested by the limit.
    // Will return io.EOF if there are no more entries with the same filter.
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Jul 12 16:23:16 UTC 2024
    - 30.7K bytes
    - Viewed (0)
  7. guava/src/com/google/common/io/BaseEncoding.java

          // extra zero bits we need to add to the end of bitsPerChar to get 3 in total.
          // The logic here would be wrong for bitsPerChar > 8, but since we require distinct ASCII
          // characters that can't happen.
          int zeroesInBitsPerChar = Integer.numberOfTrailingZeros(bitsPerChar);
          this.charsPerChunk = 1 << (3 - zeroesInBitsPerChar);
          this.bytesPerChunk = bitsPerChar >> zeroesInBitsPerChar;
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:26:48 UTC 2024
    - 41.8K bytes
    - Viewed (0)
  8. cmd/erasure-sets.go

    	}
    }
    
    type auditObjectOp struct {
    	Name string `json:"name"`
    	Pool int    `json:"poolId"`
    	Set  int    `json:"setId"`
    }
    
    func (op auditObjectOp) String() string {
    	// Flatten the auditObjectOp
    	return fmt.Sprintf("name=%s,pool=%d,set=%d", op.Name, op.Pool, op.Set)
    }
    
    // Add erasure set information to the current context
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Sep 27 10:41:37 UTC 2024
    - 37K bytes
    - Viewed (1)
  9. src/cmd/cgo/gcc.go

    	off := int64(0)
    
    	// Rename struct fields that happen to be named Go keywords into
    	// _{keyword}.  Create a map from C ident -> Go ident. The Go ident will
    	// be mangled. Any existing identifier that already has the same name on
    	// the C-side will cause the Go-mangled version to be prefixed with _.
    	// (e.g. in a struct with fields '_type' and 'type', the latter would be
    	// rendered as '__type' in Go).
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Wed Sep 18 15:07:34 UTC 2024
    - 97.1K bytes
    - Viewed (0)
  10. okhttp/src/test/java/okhttp3/EventListenerTest.kt

      }
    
      @Test
      fun responseBodyFailHttp() {
        responseBodyFail(Protocol.HTTP_1_1)
      }
    
      private fun responseBodyFail(expectedProtocol: Protocol?) {
        // Use a 2 MiB body so the disconnect won't happen until the client has read some data.
        val responseBodySize = 2 * 1024 * 1024 // 2 MiB
        server.enqueue(
          MockResponse.Builder()
            .body(Buffer().write(ByteArray(responseBodySize)))
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Sat Jan 20 10:30:28 UTC 2024
    - 56.9K bytes
    - Viewed (2)
Back to top