7 "github.com/mjl-/mox/store"
11 searchResult bool // "$"
17 last *setNumber // if nil, this numRange is just a setNumber in "first" and first.star will be false
20type setNumber struct {
25// containsSeq returns whether seq is in the numSet, given uids and (saved) searchResult.
26// uids and searchResult must be sorted. searchResult can have uids that are no longer in uids.
27func (ss numSet) containsSeq(seq msgseq, uids []store.UID, searchResult []store.UID) bool {
32 uid := uids[int(seq)-1]
33 return uidSearch(searchResult, uid) > 0 && uidSearch(uids, uid) > 0
35 return ss.containsSeqCount(seq, uint32(len(uids)))
38// containsSeqCount returns whether seq is contained in ss, which must not be a searchResult, assuming the message count.
39func (ss numSet) containsSeqCount(seq msgseq, msgCount uint32) bool {
43 for _, r := range ss.ranges {
44 first := r.first.number
45 if r.first.star || first > msgCount {
52 if r.last.star || last > msgCount {
57 first, last = last, first
60 if uint32(seq) >= first && uint32(seq) <= last {
67func (ss numSet) containsUID(uid store.UID, uids []store.UID, searchResult []store.UID) bool {
72 return uidSearch(searchResult, uid) > 0 && uidSearch(uids, uid) > 0
74 for _, r := range ss.ranges {
75 first := store.UID(r.first.number)
76 if r.first.star || first > uids[len(uids)-1] {
77 first = uids[len(uids)-1]
80 // Num in <num>:* can be larger than last, but it still matches the last...
83 last = store.UID(r.last.number)
84 if r.last.star || last > uids[len(uids)-1] {
85 last = uids[len(uids)-1]
89 first, last = last, first
91 if uid >= first && uid <= last && uidSearch(uids, uid) > 0 {
98// containsKnownUID returns whether uid, which is known to exist, matches the numSet.
99// highestUID must return the highest/last UID in the mailbox, or an error. A last UID must
100// exist, otherwise this method wouldn't have been called with a known uid.
101// highestUID is needed for interpreting UID sets like "<num>:*" where num is
102// higher than the uid to check.
103func (ss numSet) containsKnownUID(uid store.UID, searchResult []store.UID, highestUID func() (store.UID, error)) (bool, error) {
105 return uidSearch(searchResult, uid) > 0, nil
108 for _, r := range ss.ranges {
109 a := store.UID(r.first.number)
110 // Num in <num>:* can be larger than last, but it still matches the last...
113 if r.last != nil && uid >= store.UID(r.last.number) {
118 a, err = highestUID()
125 b = store.UID(r.last.number)
132 b, err = highestUID()
141 if uid >= a && uid <= b {
148// contains returns whether the numset contains the number.
149// only allowed on basic, strictly increasing numsets.
150func (ss numSet) contains(v uint32) bool {
151 for _, r := range ss.ranges {
152 if r.first.number == v || r.last != nil && v > r.first.number && v <= r.last.number {
159func (ss numSet) empty() bool {
160 return !ss.searchResult && len(ss.ranges) == 0
163// Strings returns the numset in zero or more strings of maxSize bytes. If
164// maxSize is <= 0, a single string is returned.
165func (ss numSet) Strings(maxSize int) []string {
171 for _, r := range ss.ranges {
176 s += fmt.Sprintf("%d", r.first.number)
180 panic("invalid numSet range first star without last")
187 s += fmt.Sprintf("%d", r.last.number)
191 nsize := len(line) + len(s)
195 if maxSize > 0 && nsize > maxSize {
211func (ss numSet) String() string {
219// interpretStar returns a numset that interprets stars in a numset, returning a new
220// numset without stars with increasing first/last.
221func (s numSet) interpretStar(uids []store.UID) numSet {
227 for _, r := range s.ranges {
228 first := r.first.number
229 if r.first.star || first > uint32(uids[len(uids)-1]) {
230 first = uint32(uids[len(uids)-1])
235 if r.last.star || last > uint32(uids[len(uids)-1]) {
236 last = uint32(uids[len(uids)-1])
240 first, last = last, first
242 nr := numRange{first: setNumber{number: first}}
244 nr.last = &setNumber{number: last}
246 ns.ranges = append(ns.ranges, nr)
251// whether numSet only has numbers (no star/search), and is strictly increasing.
252func (s *numSet) isBasicIncreasing() bool {
257 for _, r := range s.ranges {
258 if r.first.star || r.first.number <= last || r.last != nil && (r.last.star || r.last.number < r.first.number) {
261 last = r.first.number
275// newIter must only be called on a numSet that is basic (no star/search) and ascending.
276func (s numSet) newIter() *numIter {
277 return &numIter{s: s}
280func (i *numIter) Next() (uint32, bool) {
281 if v, ok := i.r.Next(); ok {
284 if i.i >= len(i.s.ranges) {
287 i.r = i.s.ranges[i.i].newIter()
292type rangeIter struct {
297// newIter must only be called on a range in a numSet that is basic (no star/search) and ascending.
298func (r numRange) newIter() *rangeIter {
299 return &rangeIter{r: r, o: 0}
302func (r *rangeIter) Next() (uint32, bool) {
308 return r.r.first.number, true
310 if r.r.last == nil || r.r.first.number+uint32(r.o) > r.r.last.number {
313 v := r.r.first.number + uint32(r.o)
318// append adds a new number to the set, extending a range, or starting a new one (possibly the first).
319// can only be used on basic numsets, without star/searchResult.
320func (s *numSet) append(v uint32) {
321 if len(s.ranges) == 0 {
322 s.ranges = []numRange{{first: setNumber{number: v}}}
325 ri := len(s.ranges) - 1
327 if v == r.first.number+1 && r.last == nil {
328 s.ranges[ri].last = &setNumber{number: v}
329 } else if r.last != nil && v == r.last.number+1 {
332 s.ranges = append(s.ranges, numRange{first: setNumber{number: v}})
341type sectionPart struct {
346type sectionText struct {
347 mime bool // if "MIME"
348 msgtext *sectionMsgtext
351// a non-nil *sectionSpec with nil msgtext & nil part means there were []'s, but nothing inside. e.g. "BODY[]".
352type sectionSpec struct {
353 msgtext *sectionMsgtext
357type sectionMsgtext struct {
358 s string // "HEADER", "HEADER.FIELDS", "HEADER.FIELDS.NOT", "TEXT"
359 headers []string // for "HEADER.FIELDS"*
362type fetchAtt struct {
363 field string // uppercase, eg "ENVELOPE", "BODY". ".PEEK" is removed.
366 sectionBinary []uint32
368 previewLazy bool // Not regular "PREVIEW", but "PREVIEW (LAZY)".
371type searchKey struct {
372 // Only one of searchKeys, seqSet and op can be non-nil/non-empty.
373 searchKeys []searchKey // In case of nested/multiple keys. Also for the top-level command.
374 seqSet *numSet // In case of bare sequence set. For op UID, field uidSet contains the parameter.
375 op string // Determines which of the fields below are set.
383 searchKey2 *searchKey
388func compactUIDSet(l []store.UID) (r numSet) {
391 for ; e < len(l) && l[e] == l[e-1]+1; e++ {
393 first := setNumber{number: uint32(l[0])}
396 last = &setNumber{number: uint32(l[e-1])}
398 r.ranges = append(r.ranges, numRange{first, last})