@Override public int numSlices() { return rowVectors.size(); }
public int size() { return this.ints.size() + this.longs.size(); }
@Override public int[] getNumNondefaultElements() { int[] result = new int[2]; result[ROW] = rowVectors.size(); for (Vector row : rowVectors.values()) { result[COL] = Math.max(result[COL], row.getNumNondefaultElements()); } return result; }
@Override protected MatrixSlice computeNext() { if (slice >= rowVectors.size()) { return endOfData(); } int i = keys[slice]; Vector row = rowVectors.get(i); slice++; return new MatrixSlice(row, i); } };
@Override public int numSlices() { return rowVectors.size(); }
@Override public int size() { return map.size(); }
public int getGroupCount() { return groupIndex.size(); }
public int size() { return this.ints.size() + this.longs.size(); }
@Override public int[] getNumNondefaultElements() { int[] result = new int[2]; result[ROW] = rowVectors.size(); for (Vector row : rowVectors.values()) { result[COL] = Math.max(result[COL], row.getNumNondefaultElements()); } return result; }
@Override public void putAll(Map<? extends Integer, ? extends V> m) { if (f <= .5) ensureCapacity(m.size()); // The resulting map will be sized for m.size() elements else tryCapacity(size() + m.size()); // The resulting map will be tentatively sized for size() + m.size() // elements super.putAll(m); }
@Override public Iterable<IntWritable> getPartitionDestinationVertices( int partitionId) { Int2ObjectOpenHashMap<DataInputOutput> partitionMap = map.get(partitionId); List<IntWritable> vertices = Lists.newArrayListWithCapacity(partitionMap.size()); IntIterator iterator = partitionMap.keySet().iterator(); while (iterator.hasNext()) { vertices.add(new IntWritable(iterator.nextInt())); } return vertices; }
@Override public int test() { final Int2ObjectOpenHashMap<Integer> m_map = new Int2ObjectOpenHashMap<>( m_keys.length, m_fillFactor ); for ( int i = 0; i < m_keys.length; ++i ) m_map.put( m_keys[ i ], null ); for ( int i = 0; i < m_keys.length; ++i ) m_map.put( m_keys[ i ], null ); return m_map.size(); } }
@Override protected MatrixSlice computeNext() { if (slice >= rowVectors.size()) { return endOfData(); } int i = keys[slice]; Vector row = rowVectors.get(i); slice++; return new MatrixSlice(row, i); } };
sb.append("group count: ").append(groupIndex.size()).append("\n\n");
@Override public void write(DataOutput out) throws IOException { out.writeInt(map.size()); ObjectIterator<Int2ObjectMap.Entry<V>> iterator = map.int2ObjectEntrySet().fastIterator(); while (iterator.hasNext()) { Int2ObjectMap.Entry<V> entry = iterator.next(); out.writeInt(entry.getIntKey()); valueWriter.write(out, entry.getValue()); } }
@Override public int test() { final Int2ObjectOpenHashMap<Integer> m_map = new Int2ObjectOpenHashMap<>( m_keys.length / 2 + 1, m_fillFactor ); final Integer value = 1; int add = 0, remove = 0; while ( add < m_keys.length ) { m_map.put( m_keys[ add ], value ); ++add; m_map.put( m_keys[ add ], value ); ++add; m_map.remove( m_keys[ remove++ ] ); } return m_map.size(); } }
@Override public void writePartition(DataOutput out, int partitionId) throws IOException { Int2ObjectOpenHashMap<DataInputOutput> partitionMap = map.get(partitionId); out.writeInt(partitionMap.size()); ObjectIterator<Int2ObjectMap.Entry<DataInputOutput>> iterator = partitionMap.int2ObjectEntrySet().fastIterator(); while (iterator.hasNext()) { Int2ObjectMap.Entry<DataInputOutput> entry = iterator.next(); out.writeInt(entry.getIntKey()); entry.getValue().write(out); } }
if (layer == null) { int layersCountToFree = layersCacheCountLimit - layersCache.size() + 1; final int layerSize = inputBuff.capacity(); if (layersCountToFree > 0) {
if(layer == null) { int layersCountToFree = layersCacheCountLimit - layersCache.size() + 1; final int layerSize = inputBuff.capacity(); if(layersCountToFree > 0) {