vd7-src-rbm.c

#include "cgen.h"
#include "ext/io.h"
#include "vd7-lisa.h"

struct word_tf {
  char *word;
  long tf;
};

#define TF(p)  (((struct word_tf*)p)->tf)
int word_tf_inc_cmp(const void *p1, const void *p2) {
  return TF(p2) - TF(p1);
}

#define N 10

void b1_parse(FILE *inp, rbm_t words) {
  char buff[1024];
  while (fscanf(inp, "%s", buff) == 1) {
    char *tmp = strdup(buff);
    rbm_ires res = rbm_insert(words, gtype_s(tmp), gtype_l(1));
    if (!res.inserted) {
      free(tmp);
      res.value->l += 1;
    }
  }
}

struct word_tf *b2_order_by_tf(rbm_t words) {
  long sz = bn_size((bn_tree_t)words);
  printf("Số lượng từ duy nhất = %ld\n", sz);
  struct word_tf *a = malloc(sizeof(struct word_tf) * sz);
  long idx = 0;
  rbm_traverse(k, v, words) {
    a[idx].word = k->s;
    a[idx].tf = v->l;
    ++idx;
  }
  qsort(a, idx, sizeof(struct word_tf), word_tf_inc_cmp);
  return a;
}

void b3_output(struct word_tf *a, long n) {
  for (long i = 0; i < n; ++i) {
    printf("%s: %ld\n", a[i].word, a[i].tf);
  }
}

void stop_words(const char *fname) {
  FILE *inp = fopen(fname, "r");
  rbm_t words = rbm_create(gtype_cmp_s, gtype_free_s, NULL);
  b1_parse(inp, words);
  fclose(inp);
  struct word_tf *a = b2_order_by_tf(words);
  b3_output(a, N);
  rbm_free(words);
  free(a);
}