congrats Icon
New! Announcing our next generation AI code completions
Read here
Tabnine Logo
DirectedGraphConnections.<init>
Code IndexAdd Tabnine to your IDE (free)

How to use
com.google.common.graph.DirectedGraphConnections
constructor

Best Java code snippets using com.google.common.graph.DirectedGraphConnections.<init> (Showing top 10 results out of 315)

origin: google/guava

static <N, V> DirectedGraphConnections<N, V> of() {
 // We store predecessors and successors in the same map, so double the initial capacity.
 int initialCapacity = INNER_CAPACITY * 2;
 return new DirectedGraphConnections<>(
   new HashMap<N, Object>(initialCapacity, INNER_LOAD_FACTOR), 0, 0);
}
origin: google/guava

static <N, V> DirectedGraphConnections<N, V> ofImmutable(
  Set<N> predecessors, Map<N, V> successorValues) {
 Map<N, Object> adjacentNodeValues = new HashMap<>();
 adjacentNodeValues.putAll(successorValues);
 for (N predecessor : predecessors) {
  Object value = adjacentNodeValues.put(predecessor, PRED);
  if (value != null) {
   adjacentNodeValues.put(predecessor, new PredAndSucc(value));
  }
 }
 return new DirectedGraphConnections<>(
   ImmutableMap.copyOf(adjacentNodeValues), predecessors.size(), successorValues.size());
}
origin: google/j2objc

static <N, V> DirectedGraphConnections<N, V> of() {
 // We store predecessors and successors in the same map, so double the initial capacity.
 int initialCapacity = INNER_CAPACITY * 2;
 return new DirectedGraphConnections<>(
   new HashMap<N, Object>(initialCapacity, INNER_LOAD_FACTOR), 0, 0);
}
origin: wildfly/wildfly

static <N, V> DirectedGraphConnections<N, V> of() {
 // We store predecessors and successors in the same map, so double the initial capacity.
 int initialCapacity = INNER_CAPACITY * 2;
 return new DirectedGraphConnections<>(
   new HashMap<N, Object>(initialCapacity, INNER_LOAD_FACTOR), 0, 0);
}
origin: google/j2objc

static <N, V> DirectedGraphConnections<N, V> ofImmutable(
  Set<N> predecessors, Map<N, V> successorValues) {
 Map<N, Object> adjacentNodeValues = new HashMap<>();
 adjacentNodeValues.putAll(successorValues);
 for (N predecessor : predecessors) {
  Object value = adjacentNodeValues.put(predecessor, PRED);
  if (value != null) {
   adjacentNodeValues.put(predecessor, new PredAndSucc(value));
  }
 }
 return new DirectedGraphConnections<>(
   ImmutableMap.copyOf(adjacentNodeValues), predecessors.size(), successorValues.size());
}
origin: wildfly/wildfly

static <N, V> DirectedGraphConnections<N, V> ofImmutable(
  Set<N> predecessors, Map<N, V> successorValues) {
 Map<N, Object> adjacentNodeValues = new HashMap<>();
 adjacentNodeValues.putAll(successorValues);
 for (N predecessor : predecessors) {
  Object value = adjacentNodeValues.put(predecessor, PRED);
  if (value != null) {
   adjacentNodeValues.put(predecessor, new PredAndSucc(value));
  }
 }
 return new DirectedGraphConnections<>(
   ImmutableMap.copyOf(adjacentNodeValues), predecessors.size(), successorValues.size());
}
origin: org.jboss.eap/wildfly-client-all

static <N, V> DirectedGraphConnections<N, V> of() {
 // We store predecessors and successors in the same map, so double the initial capacity.
 int initialCapacity = INNER_CAPACITY * 2;
 return new DirectedGraphConnections<>(
   new HashMap<N, Object>(initialCapacity, INNER_LOAD_FACTOR), 0, 0);
}
origin: org.kill-bill.billing/killbill-platform-osgi-bundles-logger

static <N, V> DirectedGraphConnections<N, V> of() {
 // We store predecessors and successors in the same map, so double the initial capacity.
 int initialCapacity = INNER_CAPACITY * 2;
 return new DirectedGraphConnections<>(
   new HashMap<N, Object>(initialCapacity, INNER_LOAD_FACTOR), 0, 0);
}
origin: org.jboss.eap/wildfly-client-all

static <N, V> DirectedGraphConnections<N, V> ofImmutable(
  Set<N> predecessors, Map<N, V> successorValues) {
 Map<N, Object> adjacentNodeValues = new HashMap<>();
 adjacentNodeValues.putAll(successorValues);
 for (N predecessor : predecessors) {
  Object value = adjacentNodeValues.put(predecessor, PRED);
  if (value != null) {
   adjacentNodeValues.put(predecessor, new PredAndSucc(value));
  }
 }
 return new DirectedGraphConnections<>(
   ImmutableMap.copyOf(adjacentNodeValues), predecessors.size(), successorValues.size());
}
origin: org.kill-bill.billing/killbill-platform-osgi-bundles-logger

static <N, V> DirectedGraphConnections<N, V> ofImmutable(
  Set<N> predecessors, Map<N, V> successorValues) {
 Map<N, Object> adjacentNodeValues = new HashMap<>();
 adjacentNodeValues.putAll(successorValues);
 for (N predecessor : predecessors) {
  Object value = adjacentNodeValues.put(predecessor, PRED);
  if (value != null) {
   adjacentNodeValues.put(predecessor, new PredAndSucc(value));
  }
 }
 return new DirectedGraphConnections<>(
   ImmutableMap.copyOf(adjacentNodeValues), predecessors.size(), successorValues.size());
}
com.google.common.graphDirectedGraphConnections<init>

Popular methods of DirectedGraphConnections

  • of
  • ofImmutable

Popular in Java

  • Making http post requests using okhttp
  • setRequestProperty (URLConnection)
  • getSharedPreferences (Context)
  • runOnUiThread (Activity)
  • FlowLayout (java.awt)
    A flow layout arranges components in a left-to-right flow, much like lines of text in a paragraph. F
  • Menu (java.awt)
  • Date (java.sql)
    A class which can consume and produce dates in SQL Date format. Dates are represented in SQL as yyyy
  • Collectors (java.util.stream)
  • ServletException (javax.servlet)
    Defines a general exception a servlet can throw when it encounters difficulty.
  • JComboBox (javax.swing)
  • 21 Best Atom Packages for 2021
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimAtomGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogTabnine AcademyStudentsTerms of usePrivacy policyJava Code IndexJavascript Code Index
Get Tabnine for your IDE now