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