- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 280 for Nair (0.31 sec)
-
src/main/java/org/codelibs/core/misc/Pair.java
Java - Registered: Fri Apr 12 20:58:09 GMT 2024 - Last Modified: Thu Mar 07 01:59:08 GMT 2024 - 3.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
about you: you must manage the best way you can; --but I must be kind to them,' thought Alice, `or perhaps they won't walk the way I want to go! Let me see: I'll give them a new pair of boots every Christmas.' And she went on planning to herself how she would manage it. `They must go by the carrier,' she thought; `and how funny it'll seem, sending presents to one's own feet! And how odd the
Plain Text - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Oct 29 21:35:03 GMT 2012 - 145.2K bytes - Viewed (0) -
docs/contribute/concurrency.md
## Connection Pool A primary responsibility for any HTTP client is to efficiently manage network connections. Creating and establishing new connections require a fair amount of overhead and added latency. OkHttp will make every effort to reuse existing connections to avoid this overhead and added latency.
Plain Text - Registered: Fri Apr 19 11:42:09 GMT 2024 - Last Modified: Sun Feb 06 16:35:36 GMT 2022 - 7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
about you: you must manage the best way you can; --but I must be kind to them,' thought Alice, `or perhaps they won't walk the way I want to go! Let me see: I'll give them a new pair of boots every Christmas.' And she went on planning to herself how she would manage it. `They must go by the carrier,' she thought; `and how funny it'll seem, sending presents to one's own feet! And how odd the
Plain Text - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Fri Apr 21 02:27:51 GMT 2017 - 145.2K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/helper/RelatedContentHelper.java
final Map<String, Pair<Map<String, String>, List<Pair<Pattern, String>>>> relatedContentMap = new HashMap<>(); getAvailableRelatedContentList().stream().forEach(entity -> { final String key = getHostKey(entity); Pair<Map<String, String>, List<Pair<Pattern, String>>> pair = relatedContentMap.get(key); if (pair == null) { pair = new Pair<>(new HashMap<>(), new ArrayList<>());
Java - Registered: Mon Apr 15 08:04:17 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 4.8K bytes - Viewed (0) -
okhttp/src/test/java/okhttp3/internal/cache/DiskLruCacheTest.kt
@ArgumentsSource(FileSystemParamProvider::class) fun emptyCache(parameters: Pair<FileSystem, Boolean>) { setUp(parameters.first, parameters.second) cache.close() assertJournalEquals() } @ParameterizedTest @ArgumentsSource(FileSystemParamProvider::class) fun recoverFromInitializationFailure(parameters: Pair<FileSystem, Boolean>) { setUp(parameters.first, parameters.second)
Plain Text - Registered: Fri Apr 19 11:42:09 GMT 2024 - Last Modified: Mon Apr 15 14:55:09 GMT 2024 - 75.8K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/es/log/exbhv/SearchLogBhv.java
Java - Registered: Mon Apr 15 08:04:17 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 4.8K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/mylasta/direction/FessProp.java
Java - Registered: Mon Apr 15 08:04:17 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 85K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/es/log/exentity/SearchLog.java
.collect(Collectors.groupingBy(Pair::getFirst, Collectors.mapping(Pair::getSecond, Collectors.toList()))); sourceMap.put("searchField", searchFieldMap); final Map<String, List<String>> headerMap = headerList.stream() .collect(Collectors.groupingBy(Pair::getFirst, Collectors.mapping(Pair::getSecond, Collectors.toList()))); sourceMap.put("headers", headerMap);
Java - Registered: Mon Apr 15 08:04:17 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 6K bytes - Viewed (0) -
src/cmd/api/testdata/src/pkg/p4/p4.go
// license that can be found in the LICENSE file. package p4 type Pair[T1 interface{ M() }, T2 ~int] struct { f1 T1 f2 T2 } func NewPair[T1 interface{ M() }, T2 ~int](v1 T1, v2 T2) Pair[T1, T2] { return Pair[T1, T2]{f1: v1, f2: v2} } func (p Pair[X1, _]) First() X1 { return p.f1 } func (p Pair[_, X2]) Second() X2 { return p.f2 } // Deprecated: Use something else.
Go - Registered: Tue Apr 16 11:13:10 GMT 2024 - Last Modified: Fri Dec 02 16:29:41 GMT 2022 - 552 bytes - Viewed (0)