pith/search.c

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