aboutsummaryrefslogtreecommitdiffstats
path: root/libibex/lookup.c
blob: d6bdec06a52cd500b58f233a111278a7b7bda926 (plain) (blame)
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
72
73
74
/*
    Copyright 2000 Helix Code Inc.
*/

/* lookup.c: a simple client, part 2 */

#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>

#include "ibex.h"

extern int optind;
extern char *optarg;

static void
usage(void)
{
  fprintf(stderr, "Usage: lookup [-f indexfile] word ...\n");
  exit(1);
}

int
main(int argc, char **argv)
{
  ibex *ib;
  GPtrArray *ans, *words;
  int opt, i;
  char *file = "INDEX";

  while ((opt = getopt(argc, argv, "f:")) != -1)
    {
      switch (opt)
    {
    case 'f':
      file = optarg;
      break;

    default:
      usage();
      break;
    }
    }
  argc -= optind;
  argv += optind;

  if (argc == 0)
    usage();

  ib = ibex_open(file, FALSE);
  if (!ib)
    {
      printf("Couldn't open %s: %s\n", file, strerror(errno));
      exit(1);
    }

  words = g_ptr_array_new();
  while (argc--)
    g_ptr_array_add(words, argv[argc]);

  ans = ibex_find_all(ib, words);
  if (ans)
    {
      for (i = 0; i < ans->len; i++)
    printf("%s\n", (char *)g_ptr_array_index(ans, i));
      exit(0);
    }
  else
    {
      printf("Nope.\n");
      exit(1);
    }
}