* Sebastian Hammer, Adam Dickmeiss
*
* $Log: main.c,v $
- * Revision 1.10 1995-09-28 14:22:57 adam
+ * Revision 1.12 1995-10-04 16:57:20 adam
+ * Key input and merge sort in one pass.
+ *
+ * Revision 1.11 1995/09/29 14:01:45 adam
+ * Bug fixes.
+ *
+ * Revision 1.10 1995/09/28 14:22:57 adam
* Sort uses smaller temporary files.
*
* Revision 1.9 1995/09/14 07:48:24 adam
#include "index.h"
char *prog;
+size_t mem_max = 4*1024*1024;
int main (int argc, char **argv)
{
char **mbuf;
prog = *argv;
- while ((ret = options ("r:v:", argv, argc, &arg)) != -2)
+ while ((ret = options ("r:v:m:", argv, argc, &arg)) != -2)
{
if (ret == 0)
{
else
{
unlink ("keys.tmp");
- key_open (3000000);
+ key_open (mem_max);
repository (cmd, arg, base_path);
cmd = 0;
}
{
base_path = arg;
}
+ else if (ret == 'm')
+ {
+ mem_max = 1024*1024*atoi(arg);
+ }
else
{
logf (LOG_FATAL, "Unknown option '-%s'", arg);
nsections = key_close ();
if (!nsections)
exit (0);
+#if 0
logf (LOG_LOG, "Merge sorting");
mbuf = xmalloc (100000);
merge_sort (mbuf, 1, nsections+1);
+ xfree (mbuf);
logf (LOG_LOG, "Input");
key_input (FNAME_WORD_DICT, FNAME_WORD_ISAM, "keys1.tmp", 60);
+#else
+ logf (LOG_LOG, "Input");
+ key_input2 (FNAME_WORD_DICT, FNAME_WORD_ISAM, nsections, 60);
+#endif
exit (0);
}