- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 82 for Adapter (0.12 sec)
-
src/main/java/jcifs/DfsReferralData.java
/** * Information returned in DFS referrals * * @author mbechler * @internal */ public interface DfsReferralData { /** * * @param type * @return the referral adapted to type * @throws ClassCastException * if the type is not valid for this object */ <T extends DfsReferralData> T unwrap ( Class<T> type ); /**
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Sun Jul 01 13:12:10 UTC 2018 - 1.9K bytes - Viewed (0) -
okhttp-tls/src/main/kotlin/okhttp3/tls/internal/der/AnyValue.kt
* limitations under the License. */ package okhttp3.tls.internal.der import okio.ByteString /** * A value whose type is not specified statically. Use this with [Adapters.any] which will attempt * to resolve a concrete type. */ internal data class AnyValue( var tagClass: Int, var tag: Long, var constructed: Boolean = false, var length: Long = -1L,
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 1.3K bytes - Viewed (0) -
compat/maven-model-builder/src/main/java/org/apache/maven/model/merge/MavenModelMerger.java
package org.apache.maven.model.merge; import java.util.Map; import java.util.Objects; /** * The domain-specific model merger for the Maven POM, overriding generic code from parent class when necessary with * more adapted algorithms. * * @deprecated use {@link org.apache.maven.internal.impl.model.MavenModelMerger} instead */ public class MavenModelMerger extends org.apache.maven.internal.impl.model.MavenModelMerger { /**
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 2.3K bytes - Viewed (0) -
build-logic/documentation/src/main/groovy/gradlebuild/docs/dsl/docbook/model/ClassDoc.groovy
id = className simpleName = className.tokenize('.').last() this.classMetaData = classMetaData this.extensionMetaData = extensionMetaData classSection = targetDocument.createElement('chapter') classContent.childNodes.each { Node n -> classSection << n } propertiesTable = getTable('Properties') propertiesSection = propertiesTable.parentNode
Registered: Wed Nov 06 11:36:14 UTC 2024 - Last Modified: Wed Dec 09 08:14:05 UTC 2020 - 6.2K bytes - Viewed (0) -
src/main/java/org/codelibs/core/collection/ArrayIterator.java
import java.util.Iterator; import java.util.NoSuchElementException; import org.codelibs.core.exception.ClUnsupportedOperationException; /** * 配列を{@link Iterator}にするAdaptorです。 * <p> * 次のように使います. * </p> * * <pre> * import static org.codelibs.core.collection.ArrayIterator.*; * * String[] array = ...; * for (String element : iterable(array)) { * ... * }
Registered: Fri Nov 01 20:58:10 UTC 2024 - Last Modified: Thu Mar 07 01:59:08 UTC 2024 - 2.7K bytes - Viewed (0) -
docs/en/docs/tutorial/request-forms.md
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 3.3K bytes - Viewed (0) -
docs/en/docs/tutorial/dependencies/dependencies-in-path-operation-decorators.md
/// /// info In this example we use invented custom headers `X-Key` and `X-Token`. But in real cases, when implementing security, you would get more benefits from using the integrated [Security utilities (the next chapter)](../security/index.md){.internal-link target=_blank}. /// ## Dependencies errors and return values You can use the same dependency *functions* you use normally. ### Dependency requirements
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 4K bytes - Viewed (0) -
cmd/dynamic-timeouts.go
dynamicTimeoutLogSize = 16 maxDuration = math.MaxInt64 maxDynamicTimeout = 24 * time.Hour // Never set timeout bigger than this. ) // timeouts that are dynamically adapted based on actual usage results type dynamicTimeout struct { timeout int64 minimum int64 entries int64 log [dynamicTimeoutLogSize]time.Duration mutex sync.Mutex
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Aug 19 23:21:05 UTC 2022 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Collections2.java
* * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7, * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the * first permutation will be in ascending order, and the last will be in descending order. *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 20:24:49 UTC 2024 - 22.8K bytes - Viewed (0) -
code_of_conduct.md
faith may face temporary or permanent repercussions as determined by other members of the project's leadership. ## Attribution This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4, available at [http://contributor-covenant.org/version/1/4][version] This version includes a clarification to ensure that the code of conduct is in
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Mon Jan 20 18:38:58 UTC 2020 - 3.5K bytes - Viewed (0)