- Sort Score
- Num 10 results
- Language All
Results 291 - 300 of 740 for lookUp (0.05 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
android/guava/src/com/google/common/base/Converter.java
* requirement that existing callers already fulfill). * * Disclaimer: Part of the reason that callers are so well adapted to `Function<A, B>` may be that * that is how the signature looked even prior to this comment! So naturally any change can break * existing users, but it can't *fix* existing users because any users who needed
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Jun 18 21:43:06 GMT 2025 - 22.8K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/app/service/CharMappingService.java
}).orElse(Collections.emptyList()); } /** * Retrieves the character mapping file for the specified dictionary ID. * <p> * This method looks up the dictionary file and ensures it is a character mapping file * before returning it wrapped in an OptionalEntity. * </p> * * @param dictId the dictionary ID to retrieve the character mapping file for
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Thu Aug 07 03:06:29 GMT 2025 - 6.1K bytes - Click Count (0) -
src/main/java/jcifs/Config.java
* cannot be converted to an <code>int</code>, the provided default * argument will be returned. * * @param props the properties to search in * @param key the property key to look up * @param def the default value to return if key is not found or cannot be parsed * @return the integer value of the property or the default value */
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 8.1K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/Graphs.java
/** * Add a self-loop to each node in the original graph; this is based on a definition of "cycle * incident to a node" that includes zero-length cycles. This matches the behavior of the * now-deprecated {@link #transitiveClosure(Graph)} method. */ ADD_SELF_LOOPS_ALWAYS, /** * Add a self-loop to each node that is incident to a cycle of length one or greater in theCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 24.4K bytes - Click Count (0) -
src/cmd/asm/internal/lex/lex.go
) // IsRegisterShift reports whether the token is one of the ARM register shift operators. func IsRegisterShift(r ScanToken) bool { return ROT <= r && r <= LSH // Order looks backwards because these are negative. } func (t ScanToken) String() string { switch t { case scanner.EOF: return "EOF" case scanner.Ident: return "identifier" case scanner.Int:
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Tue Aug 29 18:31:05 GMT 2023 - 4.1K bytes - Click Count (0) -
.ci/jobs.t/elastic+elasticsearch+periodic+ear.yml
dd if=/dev/zero of=dm-crypt.img bs=1 count=0 seek=60GB dd if=/dev/urandom of=key.secret bs=2k count=1 LOOP=$(losetup -f) sudo losetup $LOOP dm-crypt.img sudo cryptsetup luksFormat -q --key-file key.secret "$LOOP" sudo cryptsetup open --key-file key.secret "$LOOP" secret --verbose sudo mkfs.ext2 /dev/mapper/secret sudo mkdir /mnt/secretCreated: Wed Apr 08 16:19:15 GMT 2026 - Last Modified: Tue May 25 23:43:40 GMT 2021 - 1.5K bytes - Click Count (0) -
internal/http/dial_dnscache.go
host, port, err := net.SplitHostPort(addr) if err != nil { return nil, err } if net.ParseIP(host) != nil { // For IP only setups there is no need for DNS lookups. return baseDialCtx(ctx, "tcp", addr) } ips, err := lookupHost(ctx, host) if err != nil { return nil, err } for _, ip := range ips {
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 2.6K bytes - Click Count (0) -
.teamcity/src/main/kotlin/promotion/PublishBranchSnapshotFromQuickFeedback.kt
Created: Wed Apr 01 11:36:16 GMT 2026 - Last Modified: Thu Mar 20 06:13:56 GMT 2025 - 1.8K bytes - Click Count (0) -
cmd/storage-datatypes_test.go
} var buf bytes.Buffer msgp.Encode(&buf, &v) rd := msgp.NewEndlessReader(buf.Bytes(), b) dc := msgp.NewReader(rd) b.Log("Size:", buf.Len(), "bytes") b.SetBytes(1) b.ReportAllocs() for b.Loop() { err := v.DecodeMsg(dc) if err != nil { b.Fatal(err) } } } func BenchmarkDecodeDiskInfoMsgp(b *testing.B) { v := DiskInfo{ Total: 1000, Free: 1000, Used: 1000,
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 9.1K bytes - Click Count (0) -
.github/workflows/release-branch-cherrypick.yml
# will be created. name: Release Branch Cherrypick on: workflow_dispatch: inputs: # We use this instead of the "run on branch" argument because GitHub looks # on that branch for a workflow.yml file, and we'd have to cherry-pick # this file into those branches. release_branch: description: 'Release branch name (e.g. r2.9)' required: trueCreated: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Thu Jan 01 08:09:03 GMT 2026 - 3.1K bytes - Click Count (0)