processing/src/main/java/org/apache/druid/query/groupby/epinephelinae/HashVectorGrouper.java
/**
   * Initializes the given bucket with the given key and fresh, empty aggregation state. Must only be called if
   * {@code hashTable.canInsertNewBucket()} returns true and if this bucket is currently unused.
   */
Initializes the given bucket with the given key and fresh, empty aggregation state. Must only be called if
hashTable.canInsertNewBucket() returns true and if this bucket is currently unused.
Initializes the given bucket with the given key and fresh empty aggregation state . Must only be called if hashTable . canInsertNewBucket () returns true and if this bucket is currently unused .
private void initBucket(final int bucket, final Memory keySpace, final int keySpacePosition)
  {
    assert bucket >= 0 && bucket < maxNumBuckets && hashTable != null && hashTable.canInsertNewBucket();
    hashTable.initBucket(bucket, keySpace, keySpacePosition);
    aggregators.init(hashTable.memory().getByteBuffer(), bucket * bucketSize + hashTable.bucketValueOffset());
  }
private void initBucket ( final int bucket , final Memory keySpace , final int keySpacePosition ) { assert bucket >= 0 && bucket < maxNumBuckets && hashTable != null && hashTable . canInsertNewBucket ( ) ; hashTable . initBucket ( bucket , keySpace , keySpacePosition ) ; aggregators . init ( hashTable . memory ( ) . getByteBuffer ( ) , bucket * bucketSize + hashTable . bucketValueOffset ( ) ) ; }
Initializes the given bucket with the given key and fresh, empty aggregation state.
Initializes the given bucket with the given key and fresh empty aggregation state .