private void add(int[] ngram,long value,long[][] funcs){
  if (ngram == null)   return;
  int qValue=quantize(value);
  for (int i=1; i <= qValue; i++) {
    int hash=hashNgram(ngram,0,ngram.length,i);
    bf.add(hash,funcs);
  }
}

private void add ( int [ ] ngram , long value , long [ ] [ ] funcs ) { if ( ngram == null ) return ; int qValue = quantize ( value ) ; for ( int i = 1 ; i <= qValue ; i ++ ) { int hash = hashNgram ( ngram , 0 , ngram . length , i ) ; bf . add ( hash , funcs ) ; } }
adds an ngram , along with an associated value , to the bloom filter . this corresponds to talbot and osborne ' s " tera - scale lms on the cheap " , algorithm 1 .
