- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 87 for depth_2 (0.33 seconds)
-
compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolutionPolicy.java
private boolean newerFirst = true; @Override public MetadataGraphEdge apply(MetadataGraphEdge e1, MetadataGraphEdge e2) { int depth1 = e1.getDepth(); int depth2 = e2.getDepth(); if (depth1 == depth2) { ArtifactVersion v1 = new DefaultArtifactVersion(e1.getVersion()); ArtifactVersion v2 = new DefaultArtifactVersion(e2.getVersion());Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Fri Jun 06 14:28:57 GMT 2025 - 2.2K bytes - Click Count (0) -
src/test/java/org/codelibs/fess/sso/entraid/EntraIdAuthenticatorTest.java
EntraIdAuthenticator authenticator = new EntraIdAuthenticator(); authenticator.setMaxGroupDepth(2); // Test that depth limit returns empty arrays when depth is exceeded // With depth limit set to 2, depth 10 should return empty arrays Pair<String[], String[]> result = authenticator.getParentGroup(null, "test-id", 10); assertNotNull(result);
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sun Jan 11 08:43:05 GMT 2026 - 19.3K bytes - Click Count (0) -
compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraphEdge.java
return scope; } public void setScope(ArtifactScopeEnum scope) { this.scope = scope; } public int getDepth() { return depth; } public void setDepth(int depth) { this.depth = depth; } public boolean isResolved() { return resolved; } public void setResolved(boolean resolved) { this.resolved = resolved;Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Fri Jan 10 08:42:00 GMT 2025 - 4.8K bytes - Click Count (0) -
compat/maven-compat/src/main/java/org/apache/maven/artifact/resolver/ResolutionNode.java
this.remoteRepositories = remoteRepositories; depth = 0; parents = Collections.emptyList(); parent = null; } public ResolutionNode(Artifact artifact, List<ArtifactRepository> remoteRepositories, ResolutionNode parent) { this.artifact = artifact; this.remoteRepositories = remoteRepositories; depth = parent.depth + 1; parents = new ArrayList<>();Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Fri Oct 25 12:31:46 GMT 2024 - 6.6K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/opensearch/config/cbean/cq/bs/BsFileConfigCQ.java
public void setDepth_Equal(Integer depth) { setDepth_Term(depth, null); } public void setDepth_Equal(Integer depth, ConditionOptionCall<TermQueryBuilder> opLambda) { setDepth_Term(depth, opLambda); } public void setDepth_Term(Integer depth) { setDepth_Term(depth, null); }Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Mar 15 06:53:53 GMT 2025 - 165.3K bytes - Click Count (0) -
src/main/webapp/WEB-INF/view/admin/fileconfig/admin_fileconfig_edit.jsp
<label for="depth" class="col-sm-3 text-sm-right col-form-label"><la:message key="labels.depth"/></label> <div class="form-inline col-sm-9"> <la:errors property="depth"/> <input type="number" name="depth" id="depth"Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Mon Feb 23 08:03:44 GMT 2026 - 15.3K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/Traverser.java
} }; } /** * Returns an unmodifiable {@code Iterable} over the nodes reachable from {@code startNode}, in * the order of a breadth-first traversal. That is, all the nodes of depth 0 are returned, then * depth 1, then 2, and so on. * * <p><b>Example:</b> The following graph with {@code startNode} {@code a} would return nodes inCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 19.3K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/sso/entraid/EntraIdAuthenticator.java
final int depth) { if (logger.isDebugEnabled()) { logger.debug("[processParentGroup] Processing parent groups for id: {}, depth: {}/{}", id, depth, maxGroupDepth); } if (depth >= maxGroupDepth) { if (logger.isDebugEnabled()) { logger.debug("[processParentGroup] Maximum group depth {} reached for group {}", maxGroupDepth, id); }Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sun Mar 15 08:03:27 GMT 2026 - 56.8K bytes - Click Count (0) -
internal/s3select/jstream/decoder_test.go
"nested2": { "nested2arr": [0,1,2], "nested3": { "nested4": { "depth": "recursion" }} } } }, "2": { "nullfield": null, "id": -2 } }` ) decoder := NewDecoder(mkReader(body), 2) for mv = range decoder.Stream() { counter++ t.Logf("depth=%d offset=%d len=%d (%v)", mv.Depth, mv.Offset, mv.Length, mv.Value) } if err := decoder.Err(); err != nil {
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 6.6K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/opensearch/config/cbean/ca/bs/BsFileConfigCA.java
} public void setDepth_Avg(ConditionOptionCall<AvgAggregationBuilder> opLambda) { setDepth_Avg("depth", opLambda); } public void setDepth_Avg(String name, ConditionOptionCall<AvgAggregationBuilder> opLambda) { AvgAggregationBuilder builder = regAvgA(name, "depth"); if (opLambda != null) { opLambda.callback(builder); } }Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Mar 15 06:53:53 GMT 2025 - 144.7K bytes - Click Count (0)