gnu.trove.set.hash.TIntHashSet.contains()方法的使用及代码示例

本文整理了Java中gnu.trove.set.hash.TIntHashSet.contains()方法的一些代码示例，展示了TIntHashSet.contains()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。TIntHashSet.contains()方法的具体详情如下：
包路径：gnu.trove.set.hash.TIntHashSet
类名称：TIntHashSet
方法名：contains

TIntHashSet.contains介绍

暂无

代码示例

代码示例来源：origin: alibaba/mdrill

/** {@inheritDoc} */
public boolean containsAll( int[] array ) {
for ( int i = array.length; i-- > 0; ) {
if ( ! contains( array[i] ) ) {
return false;
}
}
return true;
}

代码示例来源：origin: osmandapp/Osmand

public int getSimpleLayer(){
if(mapIndex != null) {
if (additionalTypes != null) {
for (int i = 0; i if (mapIndex.positiveLayers.contains(additionalTypes[i])) {
return 1;
} else if (mapIndex.negativeLayers.contains(additionalTypes[i])) {
return -1;
}
}
}
}
return 0;
}

代码示例来源：origin: alibaba/mdrill

/** {@inheritDoc} */
public boolean containsAll( Collection collection ) {
for ( Object element : collection ) {
if ( element instanceof Integer ) {
int c = ( ( Integer ) element ).intValue();
if ( ! contains( c ) ) {
return false;
}
} else {
return false;
}
}
return true;
}

代码示例来源：origin: alibaba/mdrill

/** {@inheritDoc} */
public boolean containsAll( TIntCollection collection ) {
TIntIterator iter = collection.iterator();
while ( iter.hasNext() ) {
int element = iter.next();
if ( ! contains( element ) ) {
return false;
}
}
return true;
}

代码示例来源：origin: FudanNLP/fnlp

public double simJaccard(TIntHashSet s1, TIntHashSet s2) {
int com = 0;
if(s1==null||s2==null)
return 0;
TIntIterator it = s1.iterator();
for ( int i = s1.size(); i-- > 0; ) {
int v = it.next();
if(s2.contains(v))
com++;
}
double sim = com*1.0/(s1.size()+s2.size()-com);
return sim;
}
}

代码示例来源：origin: osmandapp/Osmand

if(turnSet.size() == 1) {
singleTurn = turnSet.iterator().next();
} else if(currentTurn.goAhead() && turnSet.contains(nextTurn.getValue())) {
if(currentTurn.isPossibleLeftTurn() &&
TurnType.isLeftTurn(nextTurn.getValue())) {

代码示例来源：origin: osmandapp/Osmand

infer = possibleTurns.iterator().next();
} else if (possibleTurns.size() > 1) {
if (rs.keepLeft && rs.keepRight && possibleTurns.contains(TurnType.C)) {
infer = TurnType.C;
} else if (rs.keepLeft || rs.keepRight) {

代码示例来源：origin: net.sf.trove4j/trove4j

/** {@inheritDoc} */
public boolean containsAll( int[] array ) {
for ( int i = array.length; i-- > 0; ) {
if ( ! contains( array[i] ) ) {
return false;
}
}
return true;
}

代码示例来源：origin: com.graphhopper/graphhopper

@Override
public final boolean contains( int index )
{
return tHash.contains(index);
}

代码示例来源：origin: com.palantir.patches.sourceforge/trove3

/** {@inheritDoc} */
@Override
public boolean containsAll( int[] array ) {
for ( int i = array.length; i-- > 0; ) {
if ( ! contains( array[i] ) ) {
return false;
}
}
return true;
}

代码示例来源：origin: de.unijena.bioinf.ms/gibbs_sampling

private static boolean isFixed(TIntHashSet fixedCompounds, int i) {
if (fixedCompounds==null) return false;
if (fixedCompounds.contains(i)) return true;
return false;
}

代码示例来源：origin: net.ontopia/ontopia-classify

public int trimStart(String token) {
int start = 0;
int end = token.length()-1;
for (int i=start; i if (!prechars.contains(token.charAt(i))) {
start = i;
break;
}
}
return start;
}

代码示例来源：origin: numenta/htm.java

@Override
public Object getSlice(int... coordinates) {
if (coordinates.length > this.numDimensions - 1)
sliceError(coordinates);

int[] slice = new int[this.dimensions[1]];
for (int i = 0; i slice[i] = this.columns[coordinates[0]].contains(i) ? 1 : 0;

return slice;
}

代码示例来源：origin: cc.redberry/core

private static boolean containsIndicesNames(TIntHashSet set, int[] indices) {
for (int i : indices)
if (set.contains(getNameWithType(i)))
return true;
return false;
}

代码示例来源：origin: numenta/htm.java

/**
* Returns an binary array whose length is equal to the number of inputs;
* and where 1's are set in the indexes of this pool's assigned bits.
*
* @param c {@link Connections}
* @return the sparse array
*/
public int[] getDenseConnected(Connections c) {
return IntStream.range(0, c.getNumInputs())
.map(i -> synapseConnections.contains(i) ? 1 : 0)
.toArray();
}

代码示例来源：origin: cc.redberry/core

private boolean match(Tensor t) {
if (t instanceof SimpleTensor)
return patternsNames.contains(t.hashCode());
else if (TensorUtils.isPositiveIntegerPower(t))
return patternsNames.contains(t.get(0).hashCode());
return false;
}

代码示例来源：origin: net.sf.trove4j/trove4j

/** {@inheritDoc} */
public boolean containsAll( TIntCollection collection ) {
TIntIterator iter = collection.iterator();
while ( iter.hasNext() ) {
int element = iter.next();
if ( ! contains( element ) ) {
return false;
}
}
return true;
}

代码示例来源：origin: net.sf.trove4j/core

/** {@inheritDoc} */
public boolean containsAll( TIntCollection collection ) {
TIntIterator iter = collection.iterator();
while ( iter.hasNext() ) {
int element = iter.next();
if ( ! contains( element ) ) {
return false;
}
}
return true;
}

代码示例来源：origin: de.unijena.bioinf.phylo/mincut

private void dfs(final TIntHashSet sourceSet, LinkedList edges) {
for (Edge edge : edges) {
int target = edge.dest;
if (edge.getResidualCap() != 0 && !sourceSet.contains(target)) {
sourceSet.add(target);
dfs(sourceSet, adjacencies.get(target));
}
}
}

代码示例来源：origin: chocoteam/choco-solver

public FiniteAutomaton intersection(IAutomaton otherI) {
FiniteAutomaton other = (FiniteAutomaton) otherI;
Automaton inter = this.representedBy.intersection(other.representedBy);
TIntHashSet alphabet = new TIntHashSet();
for (int a : this.alphabet.toArray()) {
if (other.alphabet.contains(a))
alphabet.add(a);
}
return new FiniteAutomaton(inter, alphabet);
}