Tabnine Logo
Int2IntRBTreeMap.put
Code IndexAdd Tabnine to your IDE (free)

How to use
put
method
in
it.unimi.dsi.fastutil.ints.Int2IntRBTreeMap

Best Java code snippets using it.unimi.dsi.fastutil.ints.Int2IntRBTreeMap.put (Showing top 10 results out of 315)

origin: it.unimi.dsi/fastutil

/**
 * Creates a new tree map using the elements of two parallel arrays and the
 * given comparator.
 *
 * @param k
 *            the array of keys of the new tree map.
 * @param v
 *            the array of corresponding values in the new tree map.
 * @param c
 *            a (possibly type-specific) comparator.
 * @throws IllegalArgumentException
 *             if {@code k} and {@code v} have different lengths.
 */
public Int2IntRBTreeMap(final int[] k, final int v[], final Comparator<? super Integer> c) {
  this(c);
  if (k.length != v.length)
    throw new IllegalArgumentException(
        "The key array and the value array have different lengths (" + k.length + " and " + v.length + ")");
  for (int i = 0; i < k.length; i++)
    this.put(k[i], v[i]);
}
/**
origin: it.unimi.dsi/fastutil

@Override
public int put(final int k, final int v) {
  modified = false;
  if (!in(k))
    throw new IllegalArgumentException("Key (" + k + ") out of range ["
        + (bottom ? "-" : String.valueOf(from)) + ", " + (top ? "-" : String.valueOf(to)) + ")");
  final int oldValue = Int2IntRBTreeMap.this.put(k, v);
  return modified ? this.defRetValue : oldValue;
}
@Override
origin: it.unimi.di/mg4j

td.clear();
tryTower( quantumBitLength, entryBitLength, toTheEnd, cacheSkipBitCount, td, false );
candidates.put( (int)( td.bitsForTowers() / td.numberOfEntries() ), entryBitLength );
origin: it.unimi.di/mg4j-big

td.clear();
tryTower( quantumBitLength, entryBitLength, toTheEnd, cacheSkipBitCount, td, false );
candidates.put( (int)( td.bitsForTowers() / td.numberOfEntries() ), entryBitLength );
origin: it.unimi.di/mg4j

td.clear();
tryTower( quantumBitLength, positionsQuantumBitLength, entryBitLength, toTheEnd, cacheSkipBitCount, td, false );
candidates.put( (int)( td.bitsForTowers() / td.numberOfEntries() ), entryBitLength );
origin: it.unimi.di/mg4j-big

td.clear();
tryTower( quantumBitLength, positionsQuantumBitLength, entryBitLength, toTheEnd, cacheSkipBitCount, td, false );
candidates.put( (int)( td.bitsForTowers() / td.numberOfEntries() ), entryBitLength );
origin: it.unimi.dsi/mg4j-big

td.clear();
tryTower( quantumBitLength, entryBitLength, toTheEnd, cacheSkipBitCount, td, false );
candidates.put( (int)( td.bitsForTowers() / td.numberOfEntries() ), entryBitLength );
origin: it.unimi.dsi/mg4j

td.clear();
tryTower( quantumBitLength, entryBitLength, toTheEnd, cacheSkipBitCount, td, false );
candidates.put( (int)( td.bitsForTowers() / td.numberOfEntries() ), entryBitLength );
origin: it.unimi.dsi/mg4j-big

td.clear();
tryTower( quantumBitLength, positionsQuantumBitLength, entryBitLength, toTheEnd, cacheSkipBitCount, td, false );
candidates.put( (int)( td.bitsForTowers() / td.numberOfEntries() ), entryBitLength );
origin: it.unimi.dsi/mg4j

td.clear();
tryTower( quantumBitLength, positionsQuantumBitLength, entryBitLength, toTheEnd, cacheSkipBitCount, td, false );
candidates.put( (int)( td.bitsForTowers() / td.numberOfEntries() ), entryBitLength );
it.unimi.dsi.fastutil.intsInt2IntRBTreeMapput

Popular methods of Int2IntRBTreeMap

  • <init>
    Creates a new tree map using the elements of two parallel arrays and the given comparator.
  • containsValue
  • firstIntKey
  • get
  • size
  • add
    Returns a node with key k in the balanced tree, creating one with defRetValue if necessary.
  • allocatePaths
  • clear
  • compare
    Compares two keys in the right way. This method uses the #actualComparator if it is non- null. Other
  • containsKey
  • findKey
    Returns the entry corresponding to the given key, if it is in the tree; null, otherwise.
  • headMap
  • findKey,
  • headMap,
  • int2IntEntrySet,
  • locateKey,
  • putAll,
  • readTree,
  • remove,
  • setActualComparator,
  • subMap

Popular in Java

  • Start an intent from android
  • addToBackStack (FragmentTransaction)
  • orElseThrow (Optional)
    Return the contained value, if present, otherwise throw an exception to be created by the provided s
  • requestLocationUpdates (LocationManager)
  • DecimalFormat (java.text)
    A concrete subclass of NumberFormat that formats decimal numbers. It has a variety of features desig
  • TreeMap (java.util)
    Walk the nodes of the tree left-to-right or right-to-left. Note that in descending iterations, next
  • Manifest (java.util.jar)
    The Manifest class is used to obtain attribute information for a JarFile and its entries.
  • JButton (javax.swing)
  • Table (org.hibernate.mapping)
    A relational table
  • Reflections (org.reflections)
    Reflections one-stop-shop objectReflections scans your classpath, indexes the metadata, allows you t
  • Best IntelliJ plugins
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

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