- Sort Score
- Result 10 results
- Languages All
Results 2431 - 2440 of 2,450 for createId (0.2 sec)
-
okhttp/src/test/java/okhttp3/internal/http2/HttpOverHttp2Test.kt
mockWebServer: MockWebServer, ) { setUp(protocol, mockWebServer) server.enqueue(MockResponse(body = "abc")) server.enqueue(MockResponse(body = "def")) // Disconnect before the stream is created. A connection is still established! val call1 = client.newCall(Request(server.url("/"))) val response = call1.execute() call1.cancel() // That connection is pooled, and it works.
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Thu Apr 11 22:09:35 UTC 2024 - 75.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/IteratorsTest.java
private static Test testsForRemoveAllAndRetainAll() { return ListTestSuiteBuilder.using( new TestStringListGenerator() { @Override public List<String> create(final String[] elements) { final List<String> delegate = newArrayList(elements); return new ForwardingList<String>() { @Override
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 54.1K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
* to prove its primality. Values from miller-rabin.appspot.com. * * NOTE: We could get slightly better bases that would be treated as unsigned, but benchmarks * showed negligible performance improvements. */ private static final long[][] millerRabinBaseSets = { {291830, 126401071349994536L},
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 09 16:39:37 UTC 2024 - 45.2K bytes - Viewed (0) -
fastapi/applications.py
name: str description: str | None = None app = FastAPI() @app.post("/items/") def create_item(item: Item): return {"message": "Item created"} ``` """ return self.router.post( path, response_model=response_model, status_code=status_code, tags=tags,
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sat Aug 17 04:52:31 UTC 2024 - 172.2K bytes - Viewed (0) -
src/cmd/asm/internal/asm/testdata/arm64.s
// Copyright 2015 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // This input was created by taking the instruction productions in // the old assembler's (7a's) grammar and hand-writing complete // instructions for each rule, to guarantee we cover the same space. #include "../../../../../runtime/textflag.h" TEXT foo(SB), DUPOK|NOSPLIT, $-8
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Wed Jul 24 18:45:14 UTC 2024 - 95.2K bytes - Viewed (0) -
src/main/webapp/js/bootstrap.min.js
hown"+Je,INSERTED:"inserted"+Je,CLICK:"click"+Je,FOCUSIN:"focusin"+Je,FOCUSOUT:"focusout"+Je,MOUSEENTER:"mouseenter"+Je,MOUSELEAVE:"mouseleave"+Je},hn=function(t){function i(){return t.apply(this,arguments)||this}!function(t,e){t.prototype=Object.create(e.prototype),(t.prototype.constructor=t).__proto__=e}(i,t);var e=i.prototype;return e.isWithContent=function(){return this.getTitle()||this._getContent()},e.addAttachmentClass=function(t){g(this.getTipElement()).addClass(tn+"-"+t)},e.getTipElement=function(){return...
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Fri Feb 07 10:28:50 UTC 2020 - 58.6K bytes - Viewed (0) -
cmd/xl-storage-format-v2.go
var nVersions int // captures all non-free versions // Our result merged = make([]xlMetaV2ShallowVersion, 0, len(versions[0])) tops := make([]xlMetaV2ShallowVersion, len(versions)) for { // Step 1 create slice with all top versions. tops = tops[:0] var topSig xlMetaV2VersionHeader consistent := true // Are all signatures consistent (shortcut) for _, vers := range versions { if len(vers) == 0 {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Oct 22 15:30:50 UTC 2024 - 64K bytes - Viewed (1) -
src/main/webapp/js/admin/bootstrap.min.js
ick.bs.popover",FOCUSIN:"focusin.bs.popover",FOCUSOUT:"focusout.bs.popover",MOUSEENTER:"mouseenter.bs.popover",MOUSELEAVE:"mouseleave.bs.popover"},Jt=function(t){var e,n;function i(){return t.apply(this,arguments)||this}n=t,(e=i).prototype=Object.create(n.prototype),e.prototype.constructor=e,u(e,n);var a=i.prototype;return a.isWithContent=function(){return this.getTitle()||this._getContent()},a.addAttachmentClass=function(t){o.default(this.getTipElement()).addClass("bs-popover-"+t)},a.getTipElem...
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Sat Oct 26 01:49:09 UTC 2024 - 61.1K bytes - Viewed (0) -
src/bufio/bufio_test.go
return } } } func createTestInput(n int) []byte { input := make([]byte, n) for i := range input { // 101 and 251 are arbitrary prime numbers. // The idea is to create an input sequence // which doesn't repeat too frequently. input[i] = byte(i % 251) if i%101 == 0 { input[i] ^= byte(i / 101) } } return input }
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Fri Nov 01 21:52:12 UTC 2024 - 51.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
She generally gave herself very good advice, (though she very seldom followed it), and sometimes she scolded herself so severely as to bring tears into her eyes; and once she remembered trying to box her own ears for having cheated herself in a game of croquet she was playing against herself, for this curious child was very fond of pretending to be two people. `But it's no use now,' thought poor Alice, `to pretend to be two people! Why,
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Oct 29 21:35:03 UTC 2012 - 145.2K bytes - Viewed (0)