ferret 0.9.0 → 0.9.1

data/ext/ram_store.c

@@ -1,6 +1,9 @@
 #include <string.h>
 #include <store.h>
 
+static char * const RENAME_ERROR_MSG = "tried to rename a file that doesn't exist";
+static char * const MISSING_RAMFILE_ERROR_MSG ="Couldn't open the ram file to read";
+
 typedef struct RamFile {
   char *name;
   uchar **buffers;
@@ -74,7 +77,7 @@ int ram_rename(Store *store, char *from, char *to)
 {
   RamFile *rf = (RamFile *)h_rem(store->dir.ht, from, false);
   if (rf == NULL)
-    eprintf(IO_ERROR, "tried to rename a file that doesn't exist");
+    RAISE(IO_ERROR, RENAME_ERROR_MSG);
 
   free(rf->name);
 
@@ -335,7 +338,7 @@ InStream *ram_open_input(Store *store, const char *filename)
 {
   RamFile *rf = (RamFile *)h_get(store->dir.ht, filename);
   if (rf == NULL) {
-    eprintf(IO_ERROR, "Couldn't open the ram file %s to read", filename);
+    RAISE(IO_ERROR, MISSING_RAMFILE_ERROR_MSG);
   }
   rf->refcnt++;
   InStream *is = is_create();

data/ext/search.c

@@ -1,6 +1,9 @@
 #include <string.h>
 #include "search.h"
 
+static char * const NUM_DOCS_ARG_ERROR_MSG = "num_docs must be > 0 to run a search";
+static char * const FIRST_DOC_ARG_ERROR_MSG = "first_doc must be >= 0 to run a search";
+
 /***************************************************************************
  *
  * Explanation
@@ -44,15 +47,11 @@ Explanation *expl_add_detail(Explanation *self, Explanation *detail)
 char *expl_to_s(Explanation *self, int depth)
 {
   int i;
-  char dbuf[32];
   char *buffer = ALLOC_N(char, depth * 2 + 1);
   memset(buffer, ' ', sizeof(char) * depth * 2);
   buffer[depth*2] = 0;
 
-  dbl_to_s(dbuf, self->value);
-  buffer = estrcat(buffer, epstrdup("%s = %s\n",
-        strlen(dbuf) + strlen(self->description),
-        dbuf, self->description));
+  buffer = estrcat(buffer, strfmt("%f = %s\n", self->value, self->description));
   for (i = 0; i < self->dcnt; i++) {
     buffer = estrcat(buffer, expl_to_s(self->details[i], depth + 1));
   }
@@ -63,12 +62,8 @@ char *expl_to_s(Explanation *self, int depth)
 char *expl_to_html(Explanation *self)
 {
   int i;
-  char dbuf[32];
   char *buffer;
-  dbl_to_s(dbuf, self->value);
-  buffer = epstrdup("<ul>\n<li>%s = %s</li>\n",
-        strlen(dbuf) + strlen(self->description),
-        dbuf, self->description);
+  buffer = strfmt("<ul>\n<li>%f = %s</li>\n", self->value, self->description);
 
   for (i = 0; i < self->dcnt; i++) {
     estrcat(buffer, expl_to_html(self->details[i]));
@@ -193,13 +188,11 @@ void td_destroy(void *p)
 char *td_to_s(TopDocs *td)
 {
   int i;
-  char dbuf[32];
   Hit *hit;
-  char *buffer = epstrdup("%d hits sorted by <score, doc_num>\n", 20, td->total_hits);
+  char *buffer = strfmt("%d hits sorted by <score, doc_num>\n", td->total_hits);
   for (i = 0; i < td->size; i++) {
     hit = td->hits[i];
-    dbl_to_s(dbuf, hit->score);
-    estrcat(buffer, epstrdup("\t%d:%s\n", 52, hit->doc, dbuf));
+    estrcat(buffer, strfmt("\t%d:%f\n", hit->doc, hit->score));
   }
   return buffer;
 }
@@ -389,10 +382,10 @@ TopDocs *sea_search(Searcher *self, Query *query, int first_doc,
 
 
   if (num_docs <= 0)
-    eprintf(ARG_ERROR, "num_docs must be > 0 to run a search");
+    RAISE(ARG_ERROR, NUM_DOCS_ARG_ERROR_MSG);
 
   if (first_doc < 0)
-    eprintf(ARG_ERROR, "first_doc must be >= 0 to run a search");
+    RAISE(ARG_ERROR, FIRST_DOC_ARG_ERROR_MSG);
 
   weight = q_weight(query, self);
   scorer = weight->scorer(weight, self->ir);
@@ -498,7 +491,7 @@ Similarity *sea_get_similarity(Searcher *self)
 
 void sea_close(Searcher *self)
 {
-  if (self->ir)
+  if (self->ir && self->close_ir)
     ir_close(self->ir);
   free(self);
 }
@@ -507,6 +500,7 @@ Searcher *sea_create(IndexReader *ir)
 {
   Searcher *self = ALLOC(Searcher);
   self->ir = ir;
+  self->close_ir = true;
   self->similarity = sim_create_default();
   self->doc_freq = &sea_doc_freq;
   self->doc_freqs = &sea_doc_freqs;

data/ext/search.h

@@ -1,53 +1,13 @@
 #ifndef FRT_SEARCH_H
 #define FRT_SEARCH_H
 
-typedef struct Similarity Similarity;
 typedef struct Query Query;
 typedef struct Weight Weight;
 typedef struct Scorer Scorer;
-typedef struct Searcher Searcher;
 
 #include "index.h"
 #include "bitvector.h"
-
-/***************************************************************************
- *
- * Similarity
- *
- ***************************************************************************/
-
-struct Similarity {
-  void *data;
-  float norm_table[256];
-  float (*length_norm)(Similarity *self, char *field, int num_terms);
-  float (*query_norm)(Similarity *self, float sum_of_squared_weights);
-  float (*tf)(Similarity *self, float freq);
-  float (*sloppy_freq)(Similarity *self, int distance);
-  float (*idf_term)(Similarity *self, Term *term, Searcher *searcher);
-  float (*idf_phrase)(Similarity *self, Term **terms, int tcnt, Searcher *searcher);
-  float (*idf)(Similarity *self, int doc_freq, int num_docs);
-  float (*coord)(Similarity *self, int overlap, int max_overlap);
-  float (*decode_norm)(Similarity *self, uchar b);
-  float (*encode_norm)(Similarity *self, float f);
-  void  (*destroy)(void *p);
-};
-
-#define sim_length_norm(msim, field, num_terms) msim->length_norm(msim, field, num_terms)
-#define sim_query_norm(msim, sosw) msim->query_norm(msim, sosw)
-#define sim_tf(msim, freq) msim->tf(msim, freq)
-#define sim_sloppy_freq(msim, distance) msim->sloppy_freq(msim, distance)
-#define sim_idf_term(msim, term, searcher) msim->idf_term(msim, term, searcher)
-#define sim_idf_phrase(msim, terms, tcnt, searcher) msim->idf_phrase(msim, terms, tcnt, searcher)
-#define sim_idf(msim, doc_freq, num_docs) msim->idf(msim, doc_freq, num_docs)
-#define sim_coord(msim, overlap, max_overlap) msim->coord(msim, overlap, max_overlap)
-#define sim_decode_norm(msim, b) msim->decode_norm(msim, b)
-#define sim_encode_norm(msim, f) msim->encode_norm(msim, f)
-#define sim_destroy(msim) msim->destroy(msim)
-
-float byte_to_float(uchar b);
-uchar float_to_byte(float f);
-
-Similarity *sim_create_default();
+#include "similarity.h"
 
 /***************************************************************************
  *
@@ -235,6 +195,7 @@ enum QUERY_TYPE {
   PHRASE_QUERY,
   MULTI_PHRASE_QUERY,
   CONSTANT_QUERY,
+  FILTERED_QUERY,
   MATCH_ALL_QUERY,
   RANGE_QUERY,
   WILD_CARD_QUERY,
@@ -306,6 +267,7 @@ typedef struct BooleanClause {
 } BooleanClause;
 
 BooleanClause *bc_create(Query *query, unsigned int occur);
+void bc_destroy(BooleanClause *self);
 void bc_set_occur(BooleanClause *self, unsigned int occur);
 
 /***************************************************************************
@@ -326,7 +288,8 @@ typedef struct BooleanQuery {
 } BooleanQuery;
 
 Query *bq_create(bool coord_disabled);
-void bq_add_query(Query *self, Query *sub_query, unsigned int occur);
+BooleanClause *bq_add_query(Query *self, Query *sub_query, unsigned int occur);
+BooleanClause *bq_add_clause(Query *self, BooleanClause *bc);
 
 /***************************************************************************
  *
@@ -420,15 +383,15 @@ Query *csq_create(Filter *filter);
 
 /***************************************************************************
  *
- * MatchAllQuery
+ * FilteredQueryQuery
  *
  ***************************************************************************/
 
-Query *maq_create();
+Query *fq_create(Query *query, Filter *filter);
 
 /***************************************************************************
  *
- * ConstantScoreQuery
+ * MatchAllQuery
  *
  ***************************************************************************/
 
@@ -453,6 +416,17 @@ Query *rq_create(const char *field, char *lower_term, char *upper_term,
 Query *rq_create_less(const char *field, char *upper_term, bool include_upper);
 Query *rq_create_more(const char *field, char *lower_term, bool include_lower);
 
+/***************************************************************************
+ *
+ * FilteredQuery
+ *
+ ***************************************************************************/
+
+typedef struct FilteredQuery {
+  Query *query;
+  Filter *filter;
+} FilteredQuery;
+
 /***************************************************************************
  *
  * SpanQuery
@@ -949,6 +923,7 @@ PriorityQueue *fshq_pq_create(int size, Sort *sort, IndexReader *ir);
 struct Searcher {
   IndexReader *ir;
   Similarity  *similarity;
+  bool         close_ir : 1;
   int          (*doc_freq)(Searcher *self, Term *term);
   int         *(*doc_freqs)(Searcher *self, Term **terms, int tcnt);
   Document    *(*get_doc)(Searcher *self, int doc_num);
@@ -1032,6 +1007,7 @@ typedef struct Index {
   bool use_compound_file : 1;
   bool auto_flush : 1;
   bool has_writes : 1;
+  bool check_latest : 1;
 } Index;
 
 Index *index_create(Store *store, Analyzer *analyzer, HashSet *def_fields,

data/ext/similarity.h

@@ -0,0 +1,67 @@
+#ifndef FRT_SIMILARITY_H
+#define FRT_SIMILARITY_H
+
+typedef struct Searcher Searcher;
+
+/****************************************************************************
+ *
+ * Term
+ *
+ ****************************************************************************/
+
+typedef struct Term {
+  char *field;
+  char *text;
+} Term;
+
+Term *term_clone(Term *term);
+Term *term_create(const char *field, char *text);
+void term_destroy(void *p);
+int term_cmp(void *t1, void *t2);
+int term_eq(const void *t1, const void *t2);
+unsigned int term_hash(const void *t);
+char *term_to_s(Term *term);
+
+/***************************************************************************
+ *
+ * Similarity
+ *
+ ***************************************************************************/
+
+typedef struct Similarity Similarity;
+
+struct Similarity {
+  void *data;
+  float norm_table[256];
+  float (*length_norm)(Similarity *self, char *field, int num_terms);
+  float (*query_norm)(Similarity *self, float sum_of_squared_weights);
+  float (*tf)(Similarity *self, float freq);
+  float (*sloppy_freq)(Similarity *self, int distance);
+  float (*idf_term)(Similarity *self, Term *term, Searcher *searcher);
+  float (*idf_phrase)(Similarity *self, Term **terms,
+      int tcnt, Searcher *searcher);
+  float (*idf)(Similarity *self, int doc_freq, int num_docs);
+  float (*coord)(Similarity *self, int overlap, int max_overlap);
+  float (*decode_norm)(Similarity *self, uchar b);
+  float (*encode_norm)(Similarity *self, float f);
+  void  (*destroy)(void *p);
+};
+
+#define sim_length_norm(msim, field, num_terms) msim->length_norm(msim, field, num_terms)
+#define sim_query_norm(msim, sosw) msim->query_norm(msim, sosw)
+#define sim_tf(msim, freq) msim->tf(msim, freq)
+#define sim_sloppy_freq(msim, distance) msim->sloppy_freq(msim, distance)
+#define sim_idf_term(msim, term, searcher) msim->idf_term(msim, term, searcher)
+#define sim_idf_phrase(msim, terms, tcnt, searcher) msim->idf_phrase(msim, terms, tcnt, searcher)
+#define sim_idf(msim, doc_freq, num_docs) msim->idf(msim, doc_freq, num_docs)
+#define sim_coord(msim, overlap, max_overlap) msim->coord(msim, overlap, max_overlap)
+#define sim_decode_norm(msim, b) msim->decode_norm(msim, b)
+#define sim_encode_norm(msim, f) msim->encode_norm(msim, f)
+#define sim_destroy(msim) msim->destroy(msim)
+
+float byte_to_float(uchar b);
+uchar float_to_byte(float f);
+
+Similarity *sim_create_default();
+
+#endif

data/ext/sort.c

@@ -2,6 +2,8 @@
 #include "search.h"
 #include "index.h"
 
+static char * const NO_TERM_ERROR_MSG = "no terms in field to sort by";
+
 /***************************************************************************
  *
  * SortField
@@ -378,8 +380,8 @@ void *field_cache_get_index(IndexReader *ir, SortField *sf)
   int length = 0;
   Term term;
   TermBuffer *tb;
-  TermEnum *te;
-  TermDocEnum *tde;
+  TermEnum *volatile te = NULL;
+  TermDocEnum *volatile tde = NULL;
   char *field = sf->field;
   SortField *sf_clone;
 
@@ -393,29 +395,32 @@ void *field_cache_get_index(IndexReader *ir, SortField *sf)
   if (index == NULL) {
     length = ir->max_doc(ir);
     if (length > 0) {
-      tde = ir->term_docs(ir);
-      term.field = field;
-      term.text = "";
-      te = ir->terms_from(ir, &term);
-      if (te->tb_curr == NULL) {
-        eprintf(ARG_ERROR, "no terms in field '%s' to sort by", field);
-      }
-
-      if (sf->type == SORT_TYPE_AUTO) {
-        sort_field_auto_evaluate(sf, te->tb_curr->text);
-      }
-
-      index = sf->create_index(length);
-
-      do { 
-        tb = te->tb_curr;
-        if (strcmp(tb->field, field) != 0) break;
-        term.text = tb->text;
-        tde->seek(tde, &term);
-        sf->handle_term(index, tde, tb->text);
-      } while (te->next(te));
-      tde->close(tde);
-      te->close(te);
+      TRY
+        tde = ir->term_docs(ir);
+        term.field = field;
+        term.text = "";
+        te = ir->terms_from(ir, &term);
+        if (te->tb_curr == NULL) {
+          RAISE(ARG_ERROR, NO_TERM_ERROR_MSG);
+        }
+
+        if (sf->type == SORT_TYPE_AUTO) {
+          sort_field_auto_evaluate(sf, te->tb_curr->text);
+        }
+
+        index = sf->create_index(length);
+
+        do { 
+          tb = te->tb_curr;
+          if (strcmp(tb->field, field) != 0) break;
+          term.text = tb->text;
+          tde->seek(tde, &term);
+          sf->handle_term(index, tde, tb->text);
+        } while (te->next(te));
+      XFINALLY
+        tde->close(tde);
+        te->close(te);
+      XENDTRY
     }
     sf_clone = sort_field_clone(sf);
     sf_clone->index = index;

data/ext/stem_ISO_8859_1_danish.c

@@ -0,0 +1,338 @@
+
+/* This file was generated automatically by the Snowball to ANSI C compiler */
+
+#include "header.h"
+
+extern int danish_ISO_8859_1_stem(struct SN_env * z);
+static int r_undouble(struct SN_env * z);
+static int r_other_suffix(struct SN_env * z);
+static int r_consonant_pair(struct SN_env * z);
+static int r_main_suffix(struct SN_env * z);
+static int r_mark_regions(struct SN_env * z);
+
+extern struct SN_env * danish_ISO_8859_1_create_env(void);
+extern void danish_ISO_8859_1_close_env(struct SN_env * z);
+
+static symbol s_0_0[3] = { 'h', 'e', 'd' };
+static symbol s_0_1[5] = { 'e', 't', 'h', 'e', 'd' };
+static symbol s_0_2[4] = { 'e', 'r', 'e', 'd' };
+static symbol s_0_3[1] = { 'e' };
+static symbol s_0_4[5] = { 'e', 'r', 'e', 'd', 'e' };
+static symbol s_0_5[4] = { 'e', 'n', 'd', 'e' };
+static symbol s_0_6[6] = { 'e', 'r', 'e', 'n', 'd', 'e' };
+static symbol s_0_7[3] = { 'e', 'n', 'e' };
+static symbol s_0_8[4] = { 'e', 'r', 'n', 'e' };
+static symbol s_0_9[3] = { 'e', 'r', 'e' };
+static symbol s_0_10[2] = { 'e', 'n' };
+static symbol s_0_11[5] = { 'h', 'e', 'd', 'e', 'n' };
+static symbol s_0_12[4] = { 'e', 'r', 'e', 'n' };
+static symbol s_0_13[2] = { 'e', 'r' };
+static symbol s_0_14[5] = { 'h', 'e', 'd', 'e', 'r' };
+static symbol s_0_15[4] = { 'e', 'r', 'e', 'r' };
+static symbol s_0_16[1] = { 's' };
+static symbol s_0_17[4] = { 'h', 'e', 'd', 's' };
+static symbol s_0_18[2] = { 'e', 's' };
+static symbol s_0_19[5] = { 'e', 'n', 'd', 'e', 's' };
+static symbol s_0_20[7] = { 'e', 'r', 'e', 'n', 'd', 'e', 's' };
+static symbol s_0_21[4] = { 'e', 'n', 'e', 's' };
+static symbol s_0_22[5] = { 'e', 'r', 'n', 'e', 's' };
+static symbol s_0_23[4] = { 'e', 'r', 'e', 's' };
+static symbol s_0_24[3] = { 'e', 'n', 's' };
+static symbol s_0_25[6] = { 'h', 'e', 'd', 'e', 'n', 's' };
+static symbol s_0_26[5] = { 'e', 'r', 'e', 'n', 's' };
+static symbol s_0_27[3] = { 'e', 'r', 's' };
+static symbol s_0_28[3] = { 'e', 't', 's' };
+static symbol s_0_29[5] = { 'e', 'r', 'e', 't', 's' };
+static symbol s_0_30[2] = { 'e', 't' };
+static symbol s_0_31[4] = { 'e', 'r', 'e', 't' };
+
+static struct among a_0[32] =
+{
+/*  0 */ { 3, s_0_0, -1, 1, 0},
+/*  1 */ { 5, s_0_1, 0, 1, 0},
+/*  2 */ { 4, s_0_2, -1, 1, 0},
+/*  3 */ { 1, s_0_3, -1, 1, 0},
+/*  4 */ { 5, s_0_4, 3, 1, 0},
+/*  5 */ { 4, s_0_5, 3, 1, 0},
+/*  6 */ { 6, s_0_6, 5, 1, 0},
+/*  7 */ { 3, s_0_7, 3, 1, 0},
+/*  8 */ { 4, s_0_8, 3, 1, 0},
+/*  9 */ { 3, s_0_9, 3, 1, 0},
+/* 10 */ { 2, s_0_10, -1, 1, 0},
+/* 11 */ { 5, s_0_11, 10, 1, 0},
+/* 12 */ { 4, s_0_12, 10, 1, 0},
+/* 13 */ { 2, s_0_13, -1, 1, 0},
+/* 14 */ { 5, s_0_14, 13, 1, 0},
+/* 15 */ { 4, s_0_15, 13, 1, 0},
+/* 16 */ { 1, s_0_16, -1, 2, 0},
+/* 17 */ { 4, s_0_17, 16, 1, 0},
+/* 18 */ { 2, s_0_18, 16, 1, 0},
+/* 19 */ { 5, s_0_19, 18, 1, 0},
+/* 20 */ { 7, s_0_20, 19, 1, 0},
+/* 21 */ { 4, s_0_21, 18, 1, 0},
+/* 22 */ { 5, s_0_22, 18, 1, 0},
+/* 23 */ { 4, s_0_23, 18, 1, 0},
+/* 24 */ { 3, s_0_24, 16, 1, 0},
+/* 25 */ { 6, s_0_25, 24, 1, 0},
+/* 26 */ { 5, s_0_26, 24, 1, 0},
+/* 27 */ { 3, s_0_27, 16, 1, 0},
+/* 28 */ { 3, s_0_28, 16, 1, 0},
+/* 29 */ { 5, s_0_29, 28, 1, 0},
+/* 30 */ { 2, s_0_30, -1, 1, 0},
+/* 31 */ { 4, s_0_31, 30, 1, 0}
+};
+
+static symbol s_1_0[2] = { 'g', 'd' };
+static symbol s_1_1[2] = { 'd', 't' };
+static symbol s_1_2[2] = { 'g', 't' };
+static symbol s_1_3[2] = { 'k', 't' };
+
+static struct among a_1[4] =
+{
+/*  0 */ { 2, s_1_0, -1, -1, 0},
+/*  1 */ { 2, s_1_1, -1, -1, 0},
+/*  2 */ { 2, s_1_2, -1, -1, 0},
+/*  3 */ { 2, s_1_3, -1, -1, 0}
+};
+
+static symbol s_2_0[2] = { 'i', 'g' };
+static symbol s_2_1[3] = { 'l', 'i', 'g' };
+static symbol s_2_2[4] = { 'e', 'l', 'i', 'g' };
+static symbol s_2_3[3] = { 'e', 'l', 's' };
+static symbol s_2_4[4] = { 'l', 0xF8, 's', 't' };
+
+static struct among a_2[5] =
+{
+/*  0 */ { 2, s_2_0, -1, 1, 0},
+/*  1 */ { 3, s_2_1, 0, 1, 0},
+/*  2 */ { 4, s_2_2, 1, 1, 0},
+/*  3 */ { 3, s_2_3, -1, 1, 0},
+/*  4 */ { 4, s_2_4, -1, 2, 0}
+};
+
+static unsigned char g_v[] = { 17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 48, 0, 128 };
+
+static unsigned char g_s_ending[] = { 239, 254, 42, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16 };
+
+static symbol s_0[] = { 's', 't' };
+static symbol s_1[] = { 'i', 'g' };
+static symbol s_2[] = { 'l', 0xF8, 's' };
+
+static int r_mark_regions(struct SN_env * z) {
+    z->I[0] = z->l;
+    {   int c_test = z->c; /* test, line 33 */
+        {   int c = z->c + 3;
+            if (0 > c || c > z->l) return 0;
+            z->c = c; /* hop, line 33 */
+        }
+        z->I[1] = z->c; /* setmark x, line 33 */
+        z->c = c_test;
+    }
+    while(1) { /* goto, line 34 */
+        int c = z->c;
+        if (!(in_grouping(z, g_v, 97, 248))) goto lab0;
+        z->c = c;
+        break;
+    lab0:
+        z->c = c;
+        if (z->c >= z->l) return 0;
+        z->c++; /* goto, line 34 */
+    }
+    while(1) { /* gopast, line 34 */
+        if (!(out_grouping(z, g_v, 97, 248))) goto lab1;
+        break;
+    lab1:
+        if (z->c >= z->l) return 0;
+        z->c++; /* gopast, line 34 */
+    }
+    z->I[0] = z->c; /* setmark p1, line 34 */
+     /* try, line 35 */
+    if (!(z->I[0] < z->I[1])) goto lab2;
+    z->I[0] = z->I[1];
+lab2:
+    return 1;
+}
+
+static int r_main_suffix(struct SN_env * z) {
+    int among_var;
+    {   int m3; /* setlimit, line 41 */
+        int m = z->l - z->c; (void) m;
+        if (z->c < z->I[0]) return 0;
+        z->c = z->I[0]; /* tomark, line 41 */
+        m3 = z->lb; z->lb = z->c;
+        z->c = z->l - m;
+        z->ket = z->c; /* [, line 41 */
+        among_var = find_among_b(z, a_0, 32); /* substring, line 41 */
+        if (!(among_var)) { z->lb = m3; return 0; }
+        z->bra = z->c; /* ], line 41 */
+        z->lb = m3;
+    }
+    switch(among_var) {
+        case 0: return 0;
+        case 1:
+            {   int ret;
+                ret = slice_del(z); /* delete, line 48 */
+                if (ret < 0) return ret;
+            }
+            break;
+        case 2:
+            if (!(in_grouping_b(z, g_s_ending, 97, 229))) return 0;
+            {   int ret;
+                ret = slice_del(z); /* delete, line 50 */
+                if (ret < 0) return ret;
+            }
+            break;
+    }
+    return 1;
+}
+
+static int r_consonant_pair(struct SN_env * z) {
+    {   int m_test = z->l - z->c; /* test, line 55 */
+        {   int m3; /* setlimit, line 56 */
+            int m = z->l - z->c; (void) m;
+            if (z->c < z->I[0]) return 0;
+            z->c = z->I[0]; /* tomark, line 56 */
+            m3 = z->lb; z->lb = z->c;
+            z->c = z->l - m;
+            z->ket = z->c; /* [, line 56 */
+            if (!(find_among_b(z, a_1, 4))) { z->lb = m3; return 0; } /* substring, line 56 */
+            z->bra = z->c; /* ], line 56 */
+            z->lb = m3;
+        }
+        z->c = z->l - m_test;
+    }
+    if (z->c <= z->lb) return 0;
+    z->c--; /* next, line 62 */
+    z->bra = z->c; /* ], line 62 */
+    {   int ret;
+        ret = slice_del(z); /* delete, line 62 */
+        if (ret < 0) return ret;
+    }
+    return 1;
+}
+
+static int r_other_suffix(struct SN_env * z) {
+    int among_var;
+    {   int m = z->l - z->c; (void) m; /* do, line 66 */
+        z->ket = z->c; /* [, line 66 */
+        if (!(eq_s_b(z, 2, s_0))) goto lab0;
+        z->bra = z->c; /* ], line 66 */
+        if (!(eq_s_b(z, 2, s_1))) goto lab0;
+        {   int ret;
+            ret = slice_del(z); /* delete, line 66 */
+            if (ret < 0) return ret;
+        }
+    lab0:
+        z->c = z->l - m;
+    }
+    {   int m3; /* setlimit, line 67 */
+        int m = z->l - z->c; (void) m;
+        if (z->c < z->I[0]) return 0;
+        z->c = z->I[0]; /* tomark, line 67 */
+        m3 = z->lb; z->lb = z->c;
+        z->c = z->l - m;
+        z->ket = z->c; /* [, line 67 */
+        among_var = find_among_b(z, a_2, 5); /* substring, line 67 */
+        if (!(among_var)) { z->lb = m3; return 0; }
+        z->bra = z->c; /* ], line 67 */
+        z->lb = m3;
+    }
+    switch(among_var) {
+        case 0: return 0;
+        case 1:
+            {   int ret;
+                ret = slice_del(z); /* delete, line 70 */
+                if (ret < 0) return ret;
+            }
+            {   int m = z->l - z->c; (void) m; /* do, line 70 */
+                {   int ret = r_consonant_pair(z);
+                    if (ret == 0) goto lab1; /* call consonant_pair, line 70 */
+                    if (ret < 0) return ret;
+                }
+            lab1:
+                z->c = z->l - m;
+            }
+            break;
+        case 2:
+            {   int ret;
+                ret = slice_from_s(z, 3, s_2); /* <-, line 72 */
+                if (ret < 0) return ret;
+            }
+            break;
+    }
+    return 1;
+}
+
+static int r_undouble(struct SN_env * z) {
+    {   int m3; /* setlimit, line 76 */
+        int m = z->l - z->c; (void) m;
+        if (z->c < z->I[0]) return 0;
+        z->c = z->I[0]; /* tomark, line 76 */
+        m3 = z->lb; z->lb = z->c;
+        z->c = z->l - m;
+        z->ket = z->c; /* [, line 76 */
+        if (!(out_grouping_b(z, g_v, 97, 248))) { z->lb = m3; return 0; }
+        z->bra = z->c; /* ], line 76 */
+        z->S[0] = slice_to(z, z->S[0]); /* -> ch, line 76 */
+        if (z->S[0] == 0) return -1; /* -> ch, line 76 */
+        z->lb = m3;
+    }
+    if (!(eq_v_b(z, z->S[0]))) return 0; /* name ch, line 77 */
+    {   int ret;
+        ret = slice_del(z); /* delete, line 78 */
+        if (ret < 0) return ret;
+    }
+    return 1;
+}
+
+extern int danish_ISO_8859_1_stem(struct SN_env * z) {
+    {   int c = z->c; /* do, line 84 */
+        {   int ret = r_mark_regions(z);
+            if (ret == 0) goto lab0; /* call mark_regions, line 84 */
+            if (ret < 0) return ret;
+        }
+    lab0:
+        z->c = c;
+    }
+    z->lb = z->c; z->c = z->l; /* backwards, line 85 */
+
+    {   int m = z->l - z->c; (void) m; /* do, line 86 */
+        {   int ret = r_main_suffix(z);
+            if (ret == 0) goto lab1; /* call main_suffix, line 86 */
+            if (ret < 0) return ret;
+        }
+    lab1:
+        z->c = z->l - m;
+    }
+    {   int m = z->l - z->c; (void) m; /* do, line 87 */
+        {   int ret = r_consonant_pair(z);
+            if (ret == 0) goto lab2; /* call consonant_pair, line 87 */
+            if (ret < 0) return ret;
+        }
+    lab2:
+        z->c = z->l - m;
+    }
+    {   int m = z->l - z->c; (void) m; /* do, line 88 */
+        {   int ret = r_other_suffix(z);
+            if (ret == 0) goto lab3; /* call other_suffix, line 88 */
+            if (ret < 0) return ret;
+        }
+    lab3:
+        z->c = z->l - m;
+    }
+    {   int m = z->l - z->c; (void) m; /* do, line 89 */
+        {   int ret = r_undouble(z);
+            if (ret == 0) goto lab4; /* call undouble, line 89 */
+            if (ret < 0) return ret;
+        }
+    lab4:
+        z->c = z->l - m;
+    }
+    z->c = z->lb;
+    return 1;
+}
+
+extern struct SN_env * danish_ISO_8859_1_create_env(void) { return SN_create_env(1, 2, 0); }
+
+extern void danish_ISO_8859_1_close_env(struct SN_env * z) { SN_close_env(z); }
+