- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 295 for structures (0.16 sec)
-
android/guava/src/com/google/common/collect/TreeTraverser.java
}; } /** Returns the children of the specified node. Must not contain null. */ public abstract Iterable<T> children(T root); /** * Returns an unmodifiable iterable over the nodes in a tree structure, using pre-order traversal. * That is, each node's subtrees are traversed after the node itself is returned. * * <p>No guarantees are made about the behavior of the traversal when nodes change while iteration
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.2K bytes - Viewed (0) -
analysis/analysis-api-fe10/src/org/jetbrains/kotlin/analysis/api/descriptors/CliFe10AnalysisFacade.kt
import org.jetbrains.kotlin.analysis.api.symbols.KtSymbolOrigin import org.jetbrains.kotlin.analysis.project.structure.KtModule import org.jetbrains.kotlin.analysis.project.structure.KtSourceModule import org.jetbrains.kotlin.analysis.project.structure.ProjectStructureProvider import org.jetbrains.kotlin.analyzer.AnalysisResult import org.jetbrains.kotlin.container.ComponentProvider
Plain Text - Registered: Fri May 03 08:18:13 GMT 2024 - Last Modified: Fri Jan 26 16:20:19 GMT 2024 - 7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
import java.util.Collection; import java.util.Set; import javax.annotation.CheckForNull; /** * An interface for <a * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data, * whose edges are anonymous entities with no identity or information of their own. * * <p>A graph is composed of a set of nodes and a set of edges connecting pairs of nodes. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 13.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MapIteratorCache.java
import java.util.Map.Entry; import java.util.Set; import javax.annotation.CheckForNull; /** * A map-like data structure that wraps a backing map and caches values while iterating through * {@link #unmodifiableKeySet()}. By design, the cache is cleared when this structure is mutated. If * this structure is never mutated, it provides a thread-safe view of the backing map. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 4.7K bytes - Viewed (0) -
internal/config/lambda/event/event.go
OutputToken string `json:"outputToken"` InputS3URL string `json:"inputS3Url"` } // Event represents lambda function event, this is undocumented in AWS S3. This // structure bases itself on this structure but there is no binding. // // { // "xAmzRequestId": "a2871150-1df5-4dc9-ad9f-3da283ca1bf3", // "getObjectContext": { // "outputRoute": "...", // "outputToken": "...",
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Tue Mar 07 16:12:41 GMT 2023 - 2.6K bytes - Viewed (0) -
doc/next/6-stdlib/99-minor/testing/fstest/63675.md
[TestFS] now returns a structured error that can be unwrapped (via method `Unwrap() []error`). This allows inspecting errors
Plain Text - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Fri Apr 12 20:57:18 GMT 2024 - 159 bytes - Viewed (0) -
docs/iam/identity-management-plugin.md
### Response If the token is valid and access is approved, the plugin must return a `200` (OK) HTTP status code. A `200 OK` Response should have `application/json` content-type and body with the following structure: ```json { "user": <string>, "maxValiditySeconds": <integer>, "claims": <key-value-pairs> } ```
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri May 27 00:58:09 GMT 2022 - 4.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
import com.google.common.annotations.Beta; import java.util.Set; import javax.annotation.CheckForNull; /** * An interface for <a * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data, * whose edges have associated non-unique values. * * <p>A graph is composed of a set of nodes and a set of edges connecting pairs of nodes. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
cmd/sts-errors.go
stsLogIf(ctx, err, logger.ErrorKind) } encodedErrorResponse := encodeResponse(stsErrorResponse) writeResponse(w, stsErr.HTTPStatusCode, encodedErrorResponse, mimeXML) } // STSError structure type STSError struct { Code string Description string HTTPStatusCode int } // STSErrorResponse - error response format type STSErrorResponse struct {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 04 12:04:40 GMT 2024 - 5.8K bytes - Viewed (0) -
doc/go_spec.html
<p> For an equation of the form <code>X ≡<sub>A</sub> Y</code>, where <code>X</code> and <code>Y</code> are types involved in an assignment (including parameter passing and return statements), the top-level type structures may unify loosely but element types must unify exactly, matching the rules for assignments. </p> <p> For an equation of the form <code>P ≡<sub>C</sub> C</code>,
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Thu May 02 22:43:51 GMT 2024 - 279.6K bytes - Viewed (0)