edge - Code Search

src/test/java/jcifs/smb/SmbResourceLocatorInternalTest.java

    }

    // Happy path: handleDFSReferral returns a resolved path
    @Test
    @DisplayName("handleDFSReferral returns resolved UNC path as stubbed")
    void handleDfsReferralValidInputs() {
        // Edge-like Windows UNC-style: a single backslash in the path
        String reqPath = "\\";
        String resolved = "smb://server/share/path";
        when(locator.handleDFSReferral(referral, reqPath)).thenReturn(resolved);

Registered: Sun Sep 07 00:10:21 UTC 2025

- Last Modified: Thu Aug 14 05:31:44 UTC 2025

- 6.9K bytes

- Viewed (0)

github.com/apache/maven

compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/GraphConflictResolutionPolicy.java

 * KIND, either express or implied.  See the License for the
 * specific language governing permissions and limitations
 * under the License.
 */
package org.apache.maven.repository.metadata;

/**
 *  MetadataGraph edge selection policy. Complements
 *  GraphConflictResolver by being injected into it
 *
 *
 */
@Deprecated
public interface GraphConflictResolutionPolicy {
    String ROLE = GraphConflictResolutionPolicy.class.getName();

Registered: Sun Sep 07 03:35:12 UTC 2025

- Last Modified: Fri Oct 25 12:31:46 UTC 2024

- 1.1K bytes

- Viewed (0)

github.com/codelibs/jcifs

src/test/java/jcifs/smb/SmbSessionImplTest.java

        // Transport wiring - used by most tests
        when(transport.acquire()).thenReturn(transport);
        when(transport.getContext()).thenReturn(cifsContext);
    }

    // Helper to set private fields for targeted edge cases
    private static void setField(Object target, String name, Object value) {
        try {
            Field f = target.getClass().getDeclaredField(name);
            f.setAccessible(true);

Registered: Sun Sep 07 00:10:21 UTC 2025

- Last Modified: Thu Aug 14 05:31:44 UTC 2025

- 12.5K bytes

- Viewed (0)

github.com/codelibs/fess

src/main/webapp/WEB-INF/orig/view/error/notFound.jsp

${fe:html(true)}
<head profile="http://a9.com/-/spec/opensearch/1.1/">
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<title><la:message key="labels.system_error_title" /></title>
<link href="${fe:url('/css/bootstrap.min.css')}" rel="stylesheet"
	type="text/css" />
<link href="${fe:url('/css/style.css')}" rel="stylesheet"
	type="text/css" />

Registered: Thu Sep 04 12:52:25 UTC 2025

- Last Modified: Sat Jan 18 12:09:07 UTC 2025

- 1.5K bytes

- Viewed (0)

github.com/go-gorm/gorm

tests/tests_all.sh

  go mod download
  go mod tidy
  cd ..
fi

# SqlServer for Mac M1
if [[ -z $GITHUB_ACTION && -d tests ]]; then
  cd tests
  if [[ $(uname -a) == *" arm64" ]]; then
    MSSQL_IMAGE=mcr.microsoft.com/azure-sql-edge docker compose up -d --wait
    go install github.com/microsoft/go-sqlcmd/cmd/sqlcmd@latest || true
    for query in \
      "IF DB_ID('gorm') IS NULL CREATE DATABASE gorm" \

Registered: Sun Sep 07 09:35:13 UTC 2025

- Last Modified: Mon Jul 21 02:46:58 UTC 2025

- 1.6K bytes

- Viewed (0)

github.com/google/guava

android/guava/src/com/google/common/graph/UndirectedNetworkConnections.java

import java.util.Map;
import java.util.Set;

/**
 * An implementation of {@link NetworkConnections} for undirected networks.
 *
 * @author James Sexton
 * @param <N> Node parameter type
 * @param <E> Edge parameter type
 */
final class UndirectedNetworkConnections<N, E> extends AbstractUndirectedNetworkConnections<N, E> {

  UndirectedNetworkConnections(Map<E, N> incidentEdgeMap) {
    super(incidentEdgeMap);
  }

Registered: Fri Sep 05 12:43:10 UTC 2025

- Last Modified: Sat Dec 21 03:10:51 UTC 2024

- 1.9K bytes

- Viewed (0)

github.com/google/guava

android/guava/src/com/google/common/graph/SuccessorsFunction.java

public interface SuccessorsFunction<N> {

  /**
   * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing
   * {@code node}'s outgoing edges in the direction (if any) of the edge.
   *
   * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing

Registered: Fri Sep 05 12:43:10 UTC 2025

- Last Modified: Mon Mar 17 20:26:29 UTC 2025

- 4.2K bytes

- Viewed (0)

github.com/google/guava

android/guava/src/com/google/common/graph/PredecessorsFunction.java

 */
@Beta
@DoNotMock("Implement with a lambda, or use GraphBuilder to build a Graph with the desired edges")
public interface PredecessorsFunction<N> {

  /**
   * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing
   * {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge.
   *
   * <p>Some algorithms that operate on a {@code PredecessorsFunction} may produce undesired results

Registered: Fri Sep 05 12:43:10 UTC 2025

- Last Modified: Mon Mar 17 20:26:29 UTC 2025

- 4K bytes

- Viewed (0)

github.com/google/guava

guava/src/com/google/common/graph/SuccessorsFunction.java

public interface SuccessorsFunction<N> {

  /**
   * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing
   * {@code node}'s outgoing edges in the direction (if any) of the edge.
   *
   * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing

Registered: Fri Sep 05 12:43:10 UTC 2025

- Last Modified: Mon Mar 17 20:26:29 UTC 2025

- 4.2K bytes

- Viewed (0)

github.com/google/guava

android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java

 *       locks---to each of the acquired locks, an edge from the soon-to-be-acquired lock is either
 *       verified or created.
 *   <li>If a new edge needs to be created, the outgoing edges of the acquired locks are traversed
 *       to check for a cycle that reaches the lock to be acquired. If no cycle is detected, a new
 *       "safe" edge is created.
 *   <li>If a cycle is detected, an "unsafe" (cyclic) edge is created to represent a potential

Registered: Fri Sep 05 12:43:10 UTC 2025

- Last Modified: Fri Jul 18 15:05:43 UTC 2025

- 35.9K bytes

- Viewed (0)

Search Options