File: dtstat.c

package info (click to toggle)
graphviz 14.1.2-1
  • links: PTS
  • area: main
  • in suites: forky, sid
  • size: 139,476 kB
  • sloc: ansic: 142,288; cpp: 11,975; python: 7,883; makefile: 4,044; yacc: 3,030; xml: 2,972; tcl: 2,495; sh: 1,391; objc: 1,159; java: 560; lex: 423; perl: 243; awk: 156; pascal: 139; php: 58; ruby: 49; cs: 31; sed: 1
file content (71 lines) | stat: -rw-r--r-- 1,637 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include "config.h"

#include <cdt/dthdr.h>
#include <stdlib.h>

/*	Get statistics of a dictionary
**
**	Written by Kiem-Phong Vo (5/25/96)
*/

static void dttstat(Dtstat_t *ds, Dtlink_t *root, size_t depth, size_t *level) {
  if (root->left)
    dttstat(ds, root->left, depth + 1, level);
  if (root->right)
    dttstat(ds, root->right, depth + 1, level);
  if (depth > ds->dt_n)
    ds->dt_n = depth;
  if (level)
    level[depth] += 1;
}

static void dthstat(Dtdata_t data, Dtstat_t *ds, size_t *count) {
  for (int h = data.ntab - 1; h >= 0; --h) {
    size_t n = 0;
    for (Dtlink_t *t = data.htab[h]; t; t = t->right)
      n += 1;
    if (count)
      count[n] += 1;
    else if (n > 0) {
      ds->dt_n += 1;
      if (n > ds->dt_max)
        ds->dt_max = n;
    }
  }
}

int dtstat(Dt_t *dt, Dtstat_t *ds, int all) {
  static size_t *Count;

  UNFLATTEN(dt);

  ds->dt_n = ds->dt_max = 0;
  ds->dt_count = NULL;
  ds->dt_size = dtsize(dt);
  ds->dt_meth = dt->data.type & DT_METHODS;

  if (!all)
    return 0;

  if (dt->data.type & DT_SET) {
    dthstat(dt->data, ds, NULL);
    free(Count);
    if (!(Count = calloc(ds->dt_max + 1, sizeof(size_t))))
      return -1;
    dthstat(dt->data, ds, Count);
  } else if (dt->data.type & (DT_OSET | DT_OBAG)) {
    if (dt->data.here) {
      dttstat(ds, dt->data.here, 0, NULL);
      free(Count);
      if (!(Count = calloc(ds->dt_n + 1, sizeof(size_t))))
        return -1;
      dttstat(ds, dt->data.here, 0, Count);
      for (size_t i = 0; i <= ds->dt_n; ++i)
        if (Count[i] > ds->dt_max)
          ds->dt_max = Count[i];
    }
  }
  ds->dt_count = Count;

  return 0;
}