Package it.unimi.dsi.fastutil.ints

Examples of it.unimi.dsi.fastutil.ints.IntOpenHashSet


  }

  public void handleClusterDisconnected()
  {
    logger.info("handleClusterDisconnected() called");
    _partitions = new IntOpenHashSet();
  }
View Full Code Here


  }
 
  @Override
  public boolean containsAny(Object set)
  {
    IntOpenHashSet setInt = (IntOpenHashSet)set;
    for(int i=0; i< this._length; i++)
      if( setInt.contains(((TermIntList) _mTermList).getPrimitiveValue(_buf[i])) )
        return true;
             
    return false;
  }
View Full Code Here

          throw new JSONException("Variable "+ symbol + " does not have value.");

        switch (typeNum)
        {
        case RelevanceJSONConstants.TYPENUMBER_SET_INT:
          hs = new IntOpenHashSet();
          for (int k = 0; k < values.length(); k++)
          {
            hs.add(values.getInt(k));
          }
          break;
View Full Code Here

  }

  public void handleClusterDisconnected()
  {
    logger.info("handleClusterDisconnected() called");
    _partitions = new IntOpenHashSet();
    _nodes = Collections.EMPTY_SET;
  }
View Full Code Here

    IntSet set1 = new IntRBTreeSet();
    while (set1.size() < limit) {
      set1.add(rand.nextInt(max));
    }

    IntSet set2 = new IntOpenHashSet();
    for (int i : set1) {
      set2.add(i);
    }

    int[] set3 = set1.toIntArray();
    Arrays.sort(set3);

    BitSet set4 = new BitSet();
    for (int i : set1) {
      set4.set(i);
    }

    long start, end;

    start = System.nanoTime();
    for (int i = 0; i < docs.length; ++i) {
      set1.contains(i);
    }
    end = System.nanoTime();
    System.out.println("set1: " + (end - start) / 1000000);

    start = System.nanoTime();
    for (int i = 0; i < docs.length; ++i) {
      set2.contains(i);
    }
    end = System.nanoTime();
    System.out.println("set2: " + (end - start) / 1000000);

    start = System.nanoTime();
View Full Code Here

    symbol2stateNew = symbol2stateNum(candidate);

    // Create state->symbols map
    state2symbols = new IntOpenHashSet[numStates];
    for (int state = 0; state < numStates; state++) {
      state2symbols[state] = new IntOpenHashSet();
      for (int symbol = 0; symbol < tree.numSymbols(); symbol++) {
        if (symbol2stateOld[symbol] == state) {
          state2symbols[state].add(symbol);
        }
        if (symbol2stateNew[symbol] == state) {
View Full Code Here

      }
    }

    @Override
    public int[] convert(FacetDataCache<String> dataCache, String[] vals) {
      IntSet intSet = new IntOpenHashSet();
      getFilters(dataCache, intSet, vals, _depth, _strict);
      return intSet.toIntArray();
    }
View Full Code Here

TOP

Related Classes of it.unimi.dsi.fastutil.ints.IntOpenHashSet

Copyright © 2018 www.massapicom. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.