pith/search.c

   1 #if !defined(lint) && !defined(DOS)
   2 static char rcsid[] = "$Id: search.c 854 2007-12-07 17:44:43Z hubert@u.washington.edu $";
   3 #endif
   4
   5 /*
   6  * ========================================================================
   7  * Copyright 2013-2020 Eduardo Chappa
   8  * Copyright 2006 University of Washington
   9  *
  10  * Licensed under the Apache License, Version 2.0 (the "License");
  11  * you may not use this file except in compliance with the License.
  12  * You may obtain a copy of the License at
  13  *
  14  *     http://www.apache.org/licenses/LICENSE-2.0
  15  *
  16  * ========================================================================
  17  */
  18
  19 #include "../pith/headers.h"
  20 #include "../pith/search.h"
  21
  22
  23 SEARCHSET *
  24 build_searchset(MAILSTREAM *stream)
  25 {
  26     long          i, run;
  27     SEARCHSET    *ret_s = NULL, **set;
  28     MESSAGECACHE *mc;
  29
  30     if(!stream)
  31       return(NULL);
  32
  33     for(i = 1L, set = &ret_s, run = 0L; i <= stream->nmsgs; i++){
  34         if(!((mc = mail_elt(stream, i)) && mc->sequence)){  /* end of run */
  35             if(run){                    /* run in progress */
  36                 set = &(*set)->next;
  37                 run = 0L;
  38             }
  39         }
  40         else if(run++){                         /* next in run */
  41             (*set)->last = i;
  42         }
  43         else{                                   /* start of new run */
  44             *set = mail_newsearchset();
  45             /*
  46              * Leave off (*set)->last until we get more than one msg
  47              * in the run, to avoid 607:607 in SEARCH.
  48              */
  49             (*set)->first = (*set)->last = i;
  50         }
  51     }
  52
  53     return(ret_s);
  54 }
  55
  56
  57 int
  58 in_searchset(SEARCHSET *srch, long unsigned int num)
  59 {
  60     SEARCHSET *s;
  61     unsigned long i;
  62
  63     if(srch)
  64       for(s = srch; s; s = s->next)
  65         for(i = s->first; i <= s->last; i++){
  66             if(i == num)
  67               return 1;
  68         }
  69
  70     return 0;
  71 }