- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 33 for posFor (0.14 sec)
-
src/go/printer/printer.go
var last *ast.Comment for p.commentBefore(next) { list := p.comment.List changed := false if p.lastTok != token.IMPORT && // do not rewrite cgo's import "C" comments p.posFor(p.comment.Pos()).Column == 1 && p.posFor(p.comment.End()+1) == next { // Unindented comment abutting next token position: // a top-level doc comment. list = formatDocComment(list) changed = true
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:03 UTC 2023 - 41.6K bytes - Viewed (0) -
src/database/sql/fakedb_test.go
} if rc.closed { return errors.New("fakedb: cursor is closed") } rc.touchMem() rc.posRow++ if rc.posRow == rc.errPos { return rc.err } if rc.posRow >= len(rc.rows[rc.posSet]) { return io.EOF // per interface spec } for i, v := range rc.rows[rc.posSet][rc.posRow].cols { // TODO(bradfitz): convert to subset types? naah, I // think the subset types should only be input to
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 01 12:38:07 UTC 2024 - 30.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* between hash algorithms and the data they act on, so alternate hash algorithms can't be easily * substituted. Also, implementations of {@code hashCode} tend to be poor-quality, in part because * they end up depending on <i>other</i> existing poor-quality {@code hashCode} implementations, * including those in many JDK classes. * * <p>{@code Object.hashCode} implementations tend to be very fast, but have weak collision
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 25 18:22:59 UTC 2021 - 10.9K bytes - Viewed (0) -
guava/src/com/google/common/hash/HashFunction.java
* between hash algorithms and the data they act on, so alternate hash algorithms can't be easily * substituted. Also, implementations of {@code hashCode} tend to be poor-quality, in part because * they end up depending on <i>other</i> existing poor-quality {@code hashCode} implementations, * including those in many JDK classes. * * <p>{@code Object.hashCode} implementations tend to be very fast, but have weak collision
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 25 18:22:59 UTC 2021 - 10.9K bytes - Viewed (0) -
guava/src/com/google/common/io/CharStreams.java
* close or flush the reader. * * <p>This is identical to {@link #copy(Readable, Appendable)} but optimized for these specific * types. CharBuffer has poor performance when being written into or read out of so round tripping * all the bytes through the buffer takes a long time. With these specialized types we can just * use a char array. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 17 14:35:11 UTC 2023 - 10.9K bytes - Viewed (0) -
android/guava/src/com/google/common/io/CharStreams.java
* close or flush the reader. * * <p>This is identical to {@link #copy(Readable, Appendable)} but optimized for these specific * types. CharBuffer has poor performance when being written into or read out of so round tripping * all the bytes through the buffer takes a long time. With these specialized types we can just * use a char array. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 17 14:35:11 UTC 2023 - 10.9K bytes - Viewed (0) -
src/cmd/compile/internal/types2/assignments.go
return } } check.errorf(rhs0, WrongAssignCount, "assignment mismatch: %s but %s", vars, vals) } func (check *Checker) returnError(at poser, lhs []*Var, rhs []*operand) { l, r := len(lhs), len(rhs) qualifier := "not enough" if r > l { at = rhs[l] // report at first extra value qualifier = "too many" } else if r > 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 23 21:21:43 UTC 2024 - 16.4K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/arch/arm64/arm64asm/plan9x.go
} else { base = fmt.Sprintf("(R%d)", regno) } if a.imm != 0 && a.Mode != AddrPostReg { off = fmt.Sprintf("%d", a.imm) } else if a.Mode == AddrPostReg { postR := fmt.Sprintf("(R%d)", a.imm) return base + postR } return off + base case MemExtend: base := "" index := "" regno := uint16(a.Base) & 31 if regno == 31 { base = "(RSP)" } else {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 16 22:24:28 UTC 2022 - 17K bytes - Viewed (0) -
okhttp/src/test/java/okhttp3/CallHandshakeTest.kt
TlsVersion.TLS_1_2, reversed, ) makeRequest(client) val expectedConnectionCipherSuites = expectedConnectionCipherSuites(client) // Will choose a poor cipher suite but not plaintext. // assertThat(handshake.cipherSuite).isEqualTo("TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256") assertThat(handshakeEnabledCipherSuites).containsExactly(
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Sat Jan 20 10:30:28 UTC 2024 - 11.2K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/arch/arm64/arm64asm/inst.go
case AddrPreIndex: return fmt.Sprintf("[%s,%s]!", R, X) case AddrPostIndex: return fmt.Sprintf("[%s],%s", R, X) case AddrPostReg: post := Reg(X0) + Reg(m.imm) postR := post.String() return fmt.Sprintf("[%s], %s", R, postR) } return fmt.Sprintf("unimplemented!") } // A MemExtend is a memory reference made up of a base R and index expression X.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 21.5K bytes - Viewed (0)