private Map<Byte,LongList> pickTopSocialProofs(SmallArrayBasedLongToDoubleMap[] socialProofs,byte[] validSocialProofs,int maxSocialProofSize){
  Map<Byte,LongList> results=new HashMap<Byte,LongList>();
  int length=validSocialProofs.length;
  for (int i=0; i < length; i++) {
    SmallArrayBasedLongToDoubleMap socialProof=socialProofs[validSocialProofs[i]];
    if (socialProof != null) {
      if (socialProof.size() > 1) {
        socialProof.sort();
      }
      socialProof.trim(maxSocialProofSize);
      results.put((byte)i,new LongArrayList(socialProof.keys()));
    }
  }
  return results;
}

private Map < Byte , LongList > pickTopSocialProofs ( SmallArrayBasedLongToDoubleMap [ ] socialProofs , byte [ ] validSocialProofs , int maxSocialProofSize ) { Map < Byte , LongList > results = new HashMap < Byte , LongList > ( ) ; int length = validSocialProofs . length ; for ( int i = 0 ; i < length ; i ++ ) { SmallArrayBasedLongToDoubleMap socialProof = socialProofs [ validSocialProofs [ i ] ] ; if ( socialProof != null ) { if ( socialProof . size ( ) > 1 ) { socialProof . sort ( ) ; } socialProof . trim ( maxSocialProofSize ) ; results . put ( ( byte ) i , new LongArrayList ( socialProof . keys ( ) ) ) ; } } return results ; }
pick the top social proofs for each rhs node
