public TIntSet keySet() { synchronized( mutex ) { if ( keySet == null ) keySet = new TSynchronizedIntSet( m.keySet(), mutex ); return keySet; } } public int[] keys() {
public TIntSet keySet() { if ( keySet == null ) keySet = TCollections.unmodifiableSet( m.keySet() ); return keySet; } public int[] keys() { return m.keys(); }
@Override public TIntSet keySet() { synchronized( mutex ) { if ( keySet == null ) keySet = new TSynchronizedIntSet( m.keySet(), mutex ); return keySet; } } @Override
public TIntSet keySet() { synchronized( mutex ) { if ( keySet == null ) keySet = new TSynchronizedIntSet( m.keySet(), mutex ); return keySet; } } public int[] keys() {
public TIntSet keySet() { if ( keySet == null ) keySet = TCollections.unmodifiableSet( m.keySet() ); return keySet; } public int[] keys() { return m.keys(); }
/** * {@inheritDoc} The set of vertices returned by this set is immutable. */ public IntSet connected() { return TroveIntSet.wrap(edges.keySet()); }
public TIntSet keySet() { synchronized( mutex ) { if ( keySet == null ) keySet = new TSynchronizedIntSet( m.keySet(), mutex ); return keySet; } } public int[] keys() {
/** * {@inheritDoc} */ public IntSet keySet() { return TroveIntSet.wrap(map.keySet()); }
/** * Returns a set of steps being recorded. * @return */ public int[] stepSet() { return probabilities.keySet().toArray(); }
/** * {@inheritDoc} */ public IntSet keySet() { return TroveIntSet.wrap(map.keySet()); }
@Override public TIntSet keySet() { if ( keySet == null ) keySet = TCollections.unmodifiableSet( m.keySet() ); return keySet; } @Override
public TIntSet keySet() { if ( keySet == null ) keySet = TCollections.unmodifiableSet( m.keySet() ); return keySet; } public int[] keys() { return m.keys(); }
public TIntSet keySet() { if ( keySet == null ) keySet = TCollections.unmodifiableSet( m.keySet() ); return keySet; } public int[] keys() { return m.keys(); }
public TIntSet keySet() { synchronized( mutex ) { if ( keySet == null ) keySet = new TSynchronizedIntSet( m.keySet(), mutex ); return keySet; } } public int[] keys() {
/** * {@inheritDoc} */ public int hashCode() { return vertexToEdges.keySet().hashCode() ^ (typeCounts.keySet().hashCode() * size); }
/** * {@inheritDoc} */ public int hashCode() { return vertexToEdges.keySet().hashCode() ^ (typeCounts.hashCode() * size); }
/** * {@inheritDoc} */ public IntSet vertices() { return PrimitiveCollections.unmodifiableSet( TroveIntSet.wrap(vertexToEdges.keySet())); }
/** * {@inheritDoc} */ public IntSet vertices() { return PrimitiveCollections.unmodifiableSet( TroveIntSet.wrap(vertexToEdges.keySet())); }
/** * {@inheritDoc} */ public IntSet vertices() { return PrimitiveCollections.unmodifiableSet( TroveIntSet.wrap(vertexToEdges.keySet())); }
/** * {@inheritDoc} */ public int hashCode() { return vertexToEdges.keySet().hashCode() ^ (typeCounts.hashCode() * size); }