- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 4,263 for length2 (0.15 sec)
-
pkg/kubelet/userns/userns_manager_test.go
assert.Equal(t, length, length2, "length == length2") // verify that re-adding the same pod with the same settings won't fail err = m.record("two", allocated2, length2) assert.NoError(t, err) // but it fails if anyting is different err = m.record("two", allocated2+1, length2) assert.Error(t, err) m.Release("one") m.Release("two") assert.Equal(t, false, m.isSet(allocated), "m.isSet(%d)", allocated)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Apr 25 14:24:16 UTC 2024 - 14.6K bytes - Viewed (0) -
src/main/java/org/codelibs/core/lang/StringUtil.java
if (target1 == null || target2 == null) { return false; } final int length1 = target1.length(); final int length2 = target2.length(); if (length1 < length2) { return false; } final String s1 = target1.substring(length1 - length2); return s1.equalsIgnoreCase(target2); } /** * 大文字小文字を無視して特定の文字で始まっているのかどうかを返します。
Registered: Wed Jun 12 12:50:12 UTC 2024 - Last Modified: Thu Mar 07 01:59:08 UTC 2024 - 21.7K bytes - Viewed (0) -
src/compress/bzip2/huffman.go
length := uint8(32) codes := make([]huffmanCode, len(lengths)) for i := len(pairs) - 1; i >= 0; i-- { if length > pairs[i].length { length = pairs[i].length } codes[i].code = code codes[i].codeLen = length codes[i].value = pairs[i].value // We need to 'increment' the code, which means treating |code| // like a |length| bit number. code += 1 << (32 - length) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 15 17:44:37 UTC 2024 - 6.7K bytes - Viewed (0) -
okhttp-tls/src/main/kotlin/okhttp3/tls/internal/der/DerReader.kt
} // Read the length. val length0 = source.readByte().toInt() and 0xff val length = when { length0 == 0b1000_0000 -> { throw ProtocolException("indefinite length not permitted for DER") } (length0 and 0b1000_0000) == 0b1000_0000 -> { // Length specified over multiple bytes. val lengthBytes = length0 and 0b0111_1111
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 10.5K bytes - Viewed (0) -
src/compress/bzip2/bzip2.go
// Now we decode the arrays of code-lengths for each tree. lengths := make([]uint8, numSymbols) for i := range huffmanTrees { // The code lengths are delta encoded from a 5-bit base value. length := br.ReadBits(5) for j := range lengths { for { if length < 1 || length > 20 { return StructuralError("Huffman length out of range") } if !br.ReadBit() { break
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 13:32:40 UTC 2024 - 13K bytes - Viewed (0) -
src/compress/flate/inflate.go
// otherwise, reference to older data case v < 265: length = v - (257 - 3) n = 0 case v < 269: length = v*2 - (265*2 - 11) n = 1 case v < 273: length = v*4 - (269*4 - 19) n = 2 case v < 277: length = v*8 - (273*8 - 35) n = 3 case v < 281: length = v*16 - (277*16 - 67) n = 4 case v < 285: length = v*32 - (281*32 - 131) n = 5 case v < maxNumLit:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Oct 13 23:20:03 UTC 2023 - 20.4K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/CipherSuite.kt
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 39.9K bytes - Viewed (0) -
src/crypto/subtle/constant_time.go
package subtle // ConstantTimeCompare returns 1 if the two slices, x and y, have equal contents // and 0 otherwise. The time taken is a function of the length of the slices and // is independent of the contents. If the lengths of x and y do not match it // returns 0 immediately. func ConstantTimeCompare(x, y []byte) int { if len(x) != len(y) { return 0 } var v byte
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 05 01:54:27 UTC 2022 - 1.8K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/internal/alias/alias.go
} // InexactOverlap reports whether x and y share memory at any non-corresponding // index. The memory beyond the slice length is ignored. Note that x and y can // have different lengths and still not have any inexact overlap. // // InexactOverlap can be used to implement the requirements of the crypto/cipher // AEAD, Block, BlockMode and Stream interfaces. func InexactOverlap(x, y []byte) bool { if len(x) == 0 || len(y) == 0 || &x[0] == &y[0] {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 1.1K bytes - Viewed (0) -
cmd/erasure-decode_test.go
r := rand.New(rand.NewSource(UTCNow().UnixNano())) buf := &bytes.Buffer{} // Verify erasure.Decode() for random offsets and lengths. for i := 0; i < iterations; i++ { offset := r.Int63n(length) readLen := r.Int63n(length - offset) expected := data[offset : offset+readLen] // Get the checksums of the current part. bitrotReaders := make([]io.ReaderAt, len(disks))
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Jan 30 20:43:25 UTC 2024 - 21.1K bytes - Viewed (0)