- Sort Score
- Num 10 results
- Language All
Results 1411 - 1420 of 5,654 for BE (0.03 seconds)
-
guava/src/com/google/common/collect/Iterators.java
* Returns the first element in {@code iterator} that satisfies the given predicate. If no such * element is found, {@code defaultValue} will be returned from this method and the iterator will * be left exhausted: its {@code hasNext()} method will return {@code false}. Note that this can * usually be handled more naturally using {@code tryFind(iterator, predicate).or(defaultValue)}. * * @since 7.0 */Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Sep 16 12:42:11 GMT 2025 - 51.4K bytes - Click Count (0) -
internal/logger/target/kafka/kafka.go
// This will block all Send operations, // and finish the existing ones. // All future ones will be discarded. h.logChMu.Lock() xioutil.SafeClose(h.logCh) h.logCh = nil h.logChMu.Unlock() if h.producer != nil { h.producer.Close() h.client.Close() } // Wait for messages to be sent... h.wg.Wait() } // New initializes a new logger target which
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 10.2K bytes - Click Count (0) -
guava-tests/test/com/google/common/util/concurrent/TestThread.java
* * Our usages should at least be *relatively* safe: Typically, threads started by a test are dying * at the end of the test, so there is no object state put at risk by stopping the threads * abruptly. In other cases, a test may put a thread into an uninterruptible operation * intentionally, so there is no other way to clean up these threads. (The better solution,
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Mar 13 13:01:07 GMT 2026 - 11.5K bytes - Click Count (0) -
internal/grid/muxserver.go
// the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // This program is distributed in the hope that it will be useful // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU Affero General Public License for more details. //
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Tue May 27 15:19:03 GMT 2025 - 9.7K bytes - Click Count (0) -
src/main/java/jcifs/internal/dfs/DfsReferralDataInternal.java
* * @return resolveHashes */ boolean isResolveHashes(); /** * Check if this referral needs to be resolved further * * @return whether this refrral needs to be resolved further */ boolean isIntermediate(); /** * Combine this referral with another to form a chain *Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 3.2K bytes - Click Count (0) -
docs/en/docs/advanced/sub-applications.md
This sub-application is just another standard FastAPI application, but this is the one that will be "mounted": {* ../../docs_src/sub_applications/tutorial001_py310.py hl[11, 14:16] *} ### Mount the sub-application { #mount-the-sub-application } In your top-level application, `app`, mount the sub-application, `subapi`. In this case, it will be mounted at the path `/subapi`:
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Sat Mar 07 09:29:03 GMT 2026 - 2.9K bytes - Click Count (0) -
cmd/xl-storage-free-version.go
// the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // This program is distributed in the hope that it will be useful // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU Affero General Public License for more details. //
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sat Mar 02 05:11:03 GMT 2024 - 3.4K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
import com.google.errorprone.annotations.DoNotMock; /** * A functional interface for <a * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data. * * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as * breadth first traversal) that only need a way of accessing the successors of a node in a graph. * * <h3>Usage</h3> * * Given an algorithm, for example: *
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 4.2K bytes - Click Count (0) -
src/main/java/jcifs/smb1/http/Handler.java
* "java.protocol.handler.pkgs", the VM uses one or more default * packages, which are vendor specific. Sun's is included below * for convenience; others could be as well. If a particular vendor's * package isn't listed, it can be specified in * "java.protocol.handler.pkgs". */ private static final String[] JVM_VENDOR_DEFAULT_PKGS = { "sun.net.www.protocol" };
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 6.1K bytes - Click Count (0) -
cmd/xl-storage-format-v2.go
// UpdateObjectVersion updates metadata and modTime for a given // versionID, NOTE: versionID must be valid and should exist - // and must not be a DeleteMarker or legacy object, if no // versionID is specified 'null' versionID is updated instead. // // It is callers responsibility to set correct versionID, this // function shouldn't be further extended to update immutable // values such as ErasureInfo, ChecksumInfo. //
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 65.6K bytes - Click Count (1)